System for monitoring the state of bingo grids

ABSTRACT

The present invention relates to a system for operating a bingo game. Play cells are organized into a pair of linked M×N grids, where each one of M and N is greater than two. Each one of the play cells bears one of a predetermined set of symbols. At least some of the symbols are selected by a means for randomly selecting different symbols from the set. The symbol selection designates the play cells to be daubed. A predetermined pattern spanning two grids is displayed by a means for displaying the pattern. The pattern is to be formed by combining different sub-patterns formed within each of the linked grids using the daubed play cells.

FIELD OF THE INVENTION

The present invention relates to bingo games. More specifically, itrelates to bingo gaming equipment.

BACKGROUND OF THE INVENTION

Bingo is a game of chance in which players are required to match numbersdrawn by a random number generator to those printed on their respectivebingo cards over the course of a bingo session.

The random number generator draws one number at a time, between one andseventy-five, until a player claims to have won, at which point the drawis temporarily interrupted in order for the claim to be verified. Oncethe verification is complete, the draw resumes, unless the claim isaccurate and signals the end of the session in progress, in which casethe random number generator is reset for the following session. Therandom number generator typically consists in a blower, namely a devicethat produces a current of air within a chamber until a ball containedtherein and assigned to a number between one and seventy-five is ejectedthrough a tube. Some of the more recent alternatives consist in computerprograms designed to randomly output one number at a time, between oneand seventy-five.

Each bingo card comprises at least one grid, namely a grid of five rowsand five columns, wherein the centermost one of the twenty-five cells isa free space and each of the remaining ones is assigned a distinctnumber between one and seventy-five. More specifically, each cell withinthe first column, namely column B, is assigned a distinct number betweenone and fifteen, each cell within the second column, namely column I, isassigned a distinct number between sixteen and thirty, each cell withinthe third column, namely column N, is assigned a distinct number betweenthirty-one and forty-five, each cell within the fourth column, namelycolumn G, is assigned a distinct number between forty-six and sixty, andeach cell within the fifth and last column, namely column O, is assigneda distinct number between sixty-one and seventy-five. A same number cannot be assigned to more than one cell within a same grid, but can verywell be assigned to more than one cell within a same card.

Over the course of a bingo session, the operator announces eight totwelve distinct patterns of cells and for each of the patterns, a numberof draws within which it is to be completed as well as a prize assignedthereto. The patterns are readily identifiable and constrained withinthe boundaries of a single grid. One such pattern consists in the letterT. Another such pattern consists in the four corners of a same grid.

As numbers are drawn, players daub matching cells on their cards in arace to daub any one of the announced patterns. Every time a playerclaims to have won the race for one of the patterns within thecorresponding number of draws, the random number generator isinterrupted and the claimant is invited to present the bingo card to theoperator. If the claim is confirmed by the presented card, the claimantis awarded the corresponding prize and the random number generatorresumes its operation as the players vie for the remaining patterns.

The distribution of numbers within bingo grids across tagged columns issuch that drawn numbers are readily identifiable within a grid, and thevisual impact of bingo patterns is such that patterns of daubed numbersare readily identifiable within a grid. As a matter of fact, it has beennoted that experienced players can run several simultaneous grids duringa same session, and readily identify drawn numbers as well as patternsof daubed numbers within the grids. Conversely, while novice players canreadily keep track of the state of a single grid, they are typicallyoverwhelmed when running several grids within a same session. Since aprize is only redeemable by the first player to rightfully claim awinning pattern, as opposed to the first person to have a winningpattern, a novice player can miss patterns that an experienced playerwould have likely identified.

SUMMARY OF THE INVENTION

As players grow accustomed to bingo patterns, their interest in the gamediminishes. The patterns become repetitive and the monitoring of severalgrids during a same session becomes effortless. There is therefore aneed for a new line of bingo games that offers greater variety to noviceand experienced players, and a greater challenge to experienced players,particularly those that run several grids simultaneously during a samesession.

At least some novice and experienced players look to increase the oddsof winning a prize by purchasing a greater number of grids. There istherefore a need for a system that allows novice and experienced playersto track the state of a greater number of grids running simultaneouslywithin a same session, particularly within the context of games whereinthe state of a grid or a card is not readily identifiable.

In accordance with one aspect of the invention, there is provided asystem for operating a bingo game played by daubing play cells bearingselected ones of a predetermined set of symbols, the system comprising apair of linked M×N grids of the play cells, each of M and N beingstrictly greater than two, each one of the play cells bearing one of theset of symbols, means for randomly selecting different ones of the setof symbols, and means for displaying a predetermined pattern spanningtwo grids, an objective of the game comprising forming the pattern usingthe daubed play cells belonging to any one of the pair of linked grids,wherein the daubed play cells used in forming the pattern form adifferent sub-pattern in each one of the pair of linked grids.

In accordance with another aspect of the invention, there is provided asystem for operating a bingo game played by daubing play cells bearingselected ones of a predetermined set of symbols, the system comprising apair of linked M×N grids of the play cells, each of M and N beingstrictly greater than two, each one of the play cells bearing one of theset of symbols, means for randomly selecting different ones of the setof symbols, and means for displaying a predetermined arithmetic functionto be satisfied by a first count of each one of the daubed play cellsbelonging to a first one of the pair of grids, and a second count ofeach one of the daubed play cells belonging to a second one of the pairof grids according to an objective of the game, wherein the arithmeticfunction is selected from a group consisting of the first count being aproduct of the second count and a multiplier, the multiplier being aninteger greater than one, and the first count being greater than thesecond count by a predetermined spread, the spread being greater thanzero.

In accordance with another aspect of the invention, there is provided asystem for operating a bingo game played by daubing play cells bearingselected ones of a predetermined set of numbers, the system comprisingan M×N grid of the play cells, each of M and N being strictly greaterthan two, each one of the play cells bearing one of the set of numbers,means for randomly selecting different ones of the set of numbers, andmeans for displaying a predetermined arithmetic function to be satisfiedby a count of each one of the daubed play cells belonging to the grid ofplay cells and a last selected one of the selected numbers borne by anyone of the play cells belonging to the grid of play cells according toan objective of the game.

In accordance with another aspect of the invention, the method ofplaying a bingo game on an M×N grid of play cells, each of M and N beingstrictly greater than two, and each one of the play cells bearing one ofa predetermined set of symbols, the method comprising providing the gridof play cells, providing a grid of at least three conversion cells,randomly selecting different ones of the set of symbols, play daubingthose of the play cells bearing one of the selected symbols, andconversion daubing a predetermined count of different ones of theconversion cells for each one of the daubed play cells satisfying atleast one predetermined criterion, an objective of the game comprisingdaubing each one of the conversion cells.

In accordance with another aspect of the invention, the card for playinga bingo game by daubing play cells bearing selected ones of apredetermined set of symbols, the card comprising one M×N grid of theplay cells, each of M and N being strictly greater than two, each one ofthe play cells bearing one of the set of symbols, each one of the playcells bearing one of the selected symbols for receiving a play daub, andone grid of at least three tracking cells, each one of the trackingcells for receiving a tracking daub for each one of the daubed playcells satisfying a predetermined criterion, the tracking daubsindicating a count of those of the daubed play cells satisfying thecriterion, an objective of the game comprising daubing each one of thetracking cells.

In accordance with another aspect of the invention, there is provided asystem for operating a bingo game played by daubing play cells bearingselected ones of a predetermined set of symbols, the system comprising aconsole for electronically displaying a grid of M×N of the play cells,each of M and N being strictly greater than two, each one of the playcells bearing one of the set of symbols, a symbol selector forperiodically and randomly selecting a different one of the set ofsymbols, a dauber for daubing each one of the play cells bearing one ofthe selected symbols, and a random attribute generator for modifying thedisplayed grid by randomly assigning an attribute designation to atleast one of the play cells, the attribute designation designating eachone of the play cells having special attributes in meeting an objectiveof the game.

In accordance with another aspect of the invention, there is provided asystem for operating a bingo game played by daubing play cells bearingselected ones of a predetermined set of symbols, the system comprisingtwo different grids of M×N of the play cells, each of M and N beingstrictly greater than two, each one of the play cells bearing one of theset of symbols, a symbol selector for periodically and randomlyselecting a different one of the set of symbols, a dauber for daubingeach one of the play cells bearing one of the selected symbols, aprogress tracker for identifying a most desirable one of the two gridsas a function of the daubed cells and an objective of the game, the moredesirable grid being closer to a game objective, and a featurecontroller for identifying the most desirable grid.

In accordance with another aspect of the invention, there is provided asystem for operating an auxiliary feature of a bingo game, the bingogame played by daubing play cells bearing selected ones of apredetermined set of symbols, the system comprising a pair of linked M×Ngrids of the play cells, each of M and N being strictly greater thantwo, each one of the play cells bearing one of the set of symbols, andmeans for displaying a predetermined pattern spanning two grids, whereinan incentive prize is awarded upon forming the pattern using the daubedplay cells belonging to any one of the pair of linked grids.

In accordance with another aspect of the invention, there is provided asystem for operating an auxiliary feature of a bingo game played bydaubing play cells bearing selected ones of a predetermined set ofsymbols, the system comprising a pair of linked M×N grids of the playcells, each of M and N being strictly greater than two, each one of theplay cells bearing one of the set of symbols, and means for displaying apredetermined arithmetic function to be satisfied by a first count ofeach one of the daubed play cells belonging to a first one of the pairof grids, and a second count of each one of the daubed play cellsbelonging to a second one of the pair of grids, wherein an incentiveprize is awarded upon satisfaction of the arithmetic function.

In accordance with another aspect of the invention, there is provided asystem for operating an auxiliary feature of a bingo game played bydaubing play cells bearing selected ones of a predetermined set ofnumbers, the system comprising an M×N grid of the play cells, each of Mand N being strictly greater than two, each one of the play cellsbearing one of the set of numbers, and means for displaying apredetermined arithmetic function to be satisfied by a count of each oneof the daubed play cells belonging to the grid of play cells and a lastselected one of the selected numbers borne by any one of the play cellsbelonging to the grid of play cells, wherein an incentive prize isawarded upon satisfaction of the arithmetic function.

In accordance with another aspect of the invention, there is provided amethod of playing a bingo game having an auxiliary feature on an M×Ngrid of play cells, each one of M and N being strictly greater than two,and each one of the play cells bearing one of a predetermined set ofnumbers, the bingo game played by play daubing each one of the playcells bearing a selected one of the set of numbers, the methodcomprising providing a grid of at least three conversion cells, andconversion daubing a predetermined count of different ones of theconversion cells for each one of the daubed play cells satisfying atleast one predetermined criterion, wherein an incentive prize is awardedwhen each one of the conversion cells is daubed.

In accordance with another aspect of the invention, there is provided asystem for operating a bingo game having an auxiliary feature, the bingogame played by daubing play cells bearing selected ones of apredetermined set of symbols, the system comprising a console forelectronically displaying a grid of M×N of the play cells, each of M andN being strictly greater than two, each one of the play cells bearingone of the set of symbols, and a random attribute generator formodifying the displayed grid by randomly assigning an attributedesignation to at least one of the play cells, the attribute designationdesignating each one of the play cells satisfying a predeterminedcriterion, wherein an incentive prize is awarded when a predeterminedcount of the daubed play cells satisfy the criterion.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention as well as a preferred mode of use, further objectives andadvantages thereof, will best be understood by reference to thefollowing detailed description of illustrative embodiments when read inconjunction with the accompanying drawings, wherein:

FIG. 1 is a triple-grid bingo card with nine daubed corner cells;

FIG. 2 is a triple-grid bingo card with daubed cells within a leftmostgrid forming a pattern in the shape of the letter “Y”, daubed cellswithin a centermost grid forming a pattern in a shape closely resemblingthat of the letter “E”, and daubed cells within the rightmost gridforming a pattern in the shape of the letter “S”;

FIG. 3 is a triple-grid bingo card with daubed cells within one gridforming a pattern in a shape closely resembling that of the letter “O”,and daubed cells within another forming a pattern in the shape of theletter “N”;

FIG. 4 is a triple-grid bingo card with a pattern extending over thethree grids and a system for recording and displaying the number ofdaubed cells bearing a same attribute designation;

FIG. 5 is a display informing players of a pattern to be daubed, thepattern extending over three grids, and the pattern being expressed inwords;

FIG. 6 is a display informing players of a pattern to be daubed, thepattern extending over three grids, and the pattern being described bylines traced within three sample grids;

FIG. 7 is a flowchart illustrating a method of operating a system forplaying a bingo game in which a prize is awarded when a pattern spanningthree linked grids is daubed;

FIG. 8 is a triple-faced bingo card with two daubed cells within theleftmost grid, six within the centermost grid, and nine within therightmost grid;

FIG. 9 is a display informing players of an arithmetic function to besatisfied by counts of daubed cells belonging to three linked grids, thearithmetic function being expressed in words;

FIG. 10 is a display informing players of an arithmetic function to besatisfied using counts of daubed cells belonging to three linked grids,the arithmetic function being illustrated using three linked samplegrids;

FIG. 11 is a flowchart illustrating a method of operating a system forplaying a bingo game in which a prize is awarded when counts of daubedcells belonging to three linked grids is satisfied;

FIG. 12 is a grid is a single-grid bingo card with five daubed cells anda yet to be daubed one bearing the number six;

FIG. 13 is a display informing players of an arithmetic function to besatisfied by a count of daubed cells belonging to a same grid and anumber borne by the last cell to be daubed within the grid, thearithmetic function being expressed in words;

FIG. 14 is a display informing players of an arithmetic function to besatisfied using counts of daubed cells belonging to three linked grids,the arithmetic function being illustrated using a sample grid;

FIG. 15 is a flowchart illustrating a method of operating a system forplaying a bingo game in which a prize is awarded when counts of daubedcells belonging to three linked grids is satisfied;

FIG. 16 is a flowchart illustrating a method of operating a system forplaying a bingo game in which a prize is awarded when all conversioncells are daubed;

FIG. 17 is a flowchart illustrating a method of tracking a count ofdaubed play cells satisfying a predetermined criterion;

FIG. 18 is a block diagram of a system for operating a bingo game withevolving grids;

FIG. 19 is a block diagram of a system for operating a bingo game inwhich players are informed of grid desirability; and

FIG. 20 illustrates a blower for randomly selecting bingo numbers.

DESCRIPTION OF PREFERRED EMBODIMENTS OF THE INVENTION

The present invention will be described more fully hereinafter withreference to the accompanying drawings, in which like numerals refer tolike elements throughout.

Principal Bingo Game

The following embodiments relate to systems for operating and methods ofplaying new bingo games. The objective of bingo games is traditionallyestablished as a function of readily identifiable patterns of cells tobe daubed within a same grid, also known as a face, each of which isdefined by a predetermined count of cells that clearly distinguishthemselves from the others by their positional relationships. One of themost popular patterns consists in five horizontally aligned cells.Another one consists in four corner cells. As players grow accustomed tosuch patterns, their interest in the game diminishes; the patternsbecome repetitive and the monitoring of several grids during a samesession becomes effortless.

Disclosed herein is a bingo game, the objective of which is defined as afunction of a predetermined pattern of cells to be daubed, the patternextending over more than one of several linked grids and formingdifferent sub-patterns therein. As a result, different contributions areexpected from more than one of several linked grids towards the pattern.Within the context of such a game, in order to establish the state ofthe linked grids, the player must assess the individual contribution ofeach of the grids towards the pattern, and subsequently determinewhether the assessed contributions collectively lead to the desiredpattern. As a result, such patterns are not as readily identifiable astheir traditional counterparts.

According to one embodiment, the first player that rightfully claims tohave daubed four, three, and two corner play cells within three linkedgrids is awarded a corresponding prize. Referring to FIG. 5, there isillustrated a display informing players of the pattern to be daubed,where the pattern is described in words 502. The display 500 can beelectronic, such as an LCD screen, and of a sufficient size to bereadily visible by all players seated in a bingo hall. Alternatively,the display 500 can be electronic, but displayed on individual consolesthat are portable or embedded in the play tables of the bingo hall. Thedisplay 500 can also be a board on which the words 502 are written usingchalk or a felt-tip pen.

The predetermined pattern is to be formed using daubed play cells,namely play cells bearing selected ones of a predetermined set ofsymbols such as numbers. Symbols are selected by a means for randomlyselecting different ones of the set of symbols, such as computer programimplementing a random number generator. Alternatively, and referring toFIG. 20, the means of randomly selecting different ones of the set ofsymbols can be a blower 2000, namely a device that produces a current ofair within a chamber until a ball contained therein and assigned to oneof the symbols is ejected through a tube.

The play cells for receiving daubs are organized into grids, which canbe displayed on electronic consoles that are portable or embedded intoplay tables. Alternatively, the grids can be printed on bingo cards.Referring to FIG. 1, there is illustrated a bingo card 100 with threelinked and horizontally aligned grids, namely a grid 102, grid 104, andgrid 106. Furthermore, three corner cells 112 are daubed within the grid102, two corner cells 114 are daubed within the grid 104, and fourcorner cells 116 are daubed within the grid 106.

In order to establish the state of the bingo card 100, the playerdetermines whether at least two corner cells are daubed within the grid102. In this particular case, only one of the four corner cells aredaubed, namely the play cell 112. Since the prize is assigned to thefirst player that rightfully claims to have daubed four, three, and twocorner cells within the grid 102, the grid 104, and the grid 106, andsince only one of the four corner cells has been daubed within the grid102, the player concludes that the objective is yet to be reached withinthe bingo card 100, regardless of the cells daubed within the grid 104and grid 106. If not rushed in time, the player can determine whetherall corner cells of the grid 104 and grid 106 are daubed to establishthe complete state of the card 100 in anticipation of subsequent draws.The player would conclude that two of the four corner cells of the grid104, namely the cells 114, and three corner cells 116 of the grid 106are daubed. Furthermore, the player would conclude that daubing anadditional corner cell of each one of the grids 102, 104, and 106 wouldlead to the objective. Conversely, if rushed in time, the player canforego this process in order to determine whether the objective isreached within other active cards before the subsequent draw.

Within the context of the latter embodiment, the contributions expectedfrom the linked grids involve corner cells exclusively. However,according to other embodiments, the contributions involve a greaternumber of play cells. Such embodiments present distinct challenges withrespect to state monitoring as greater contributions are expected fromthe linked grids.

According to a preferred embodiment, the first player that rightfullyclaims to have daubed cells forming a pattern in the shape of the letter“Y” within a rightmost one of three linked and horizontally alignedgrids, in the shape of the letter “E” within a centermost one of thegrids, and in the shape of the letter “S” within a leftmost one of thegrids, the combination of which spells the word “YES” within the bingocard on which all three grids are printed, is awarded a correspondingprize. Referring to FIG. 6, there is illustrated the display 500informing players of the pattern to be daubed, where the pattern isdescribed using a lines 608 traced within three sample grids 602, 604,and 606.

Referring to FIG. 2, there is illustrated a bingo card 200 with threelinked and horizontally aligned grids, namely a grid 202, grid 204, andgrid 206. Cells daubed within the grid 202 form a pattern in the shapeof the letter “Y”, those within the grid 204 form a pattern in a shapeclosely resembling that of the letter “E”, and those within the grid 206form a pattern in the shape of the letter “S”.

In order to establish the state of the bingo card 200, the playerdetermines whether cells daubed within the grid 202 form a pattern inthe shape of the letter “Y”, and concludes that such a pattern is indeedformed. Subsequently, the player determines whether cells daubed withinthe grid 204 form a pattern in the shape of the letter “E” and concludesthat no such pattern is formed. More specifically, an additional cell,namely a cell 212 bearing the number twenty, needs to be daubed withinthe grid 202 in order for such a pattern to be formed. Since theobjective consists in daubing cells that form a pattern in the shape ofthe letter “Y” within the grid 202, in the shape of the letter “E”within the grid 204, and in the shape of the letter “S” within the grid206, the player further concludes that the objective is yet to bereached within the card 200. If not rushed in time, the player candetermine whether cells daubed within the grid 206 form a pattern in theshape of the letter “S” to establish the complete state of the card 200in anticipation of subsequent draws. If the player chooses to do so, theplayer concludes that such a pattern is indeed formed within the grid206 and the cell 212 is the only one left in order for the objective tobe reached within the card 200. Conversely, if rushed in time, theplayer can forego this process in order to determine whether theobjective is reached within other active cards before the subsequentdraw.

Within the context of the latter embodiment, a different and specificcontribution is expected from each one of three linked grids. However,according to other embodiments, different contributions are expectedfrom some of linked grids, but no contribution is assigned to a specificone of the grids. Such embodiments present distinct challenges withrespect to state monitoring as each one of the contributions can beprovided by any one of the linked grids.

According to a preferred embodiment, the first player that rightfullyclaims to have daubed cells forming a pattern in the shape of the letter“O” within a first of three linked and horizontally aligned grids, andin the shape of the letter “N” within another one of the linked grids,the combination of which spells either one of the words “NO” and “ON”within the bingo card in which the grids are presented, is awarded acorresponding prize. Referring to FIG. 3, there is illustrated a bingocard 300 with three linked and horizontally aligned grids, namely a grid302, a grid 304, and grid 306. All but one peripheral cell of the grid302 are daubed. Furthermore, cells daubed within the grid 306 form apattern in the shape of the letter “N”.

In order to establish the state of the bingo card 300, the playerdetermines whether cells daubed within the grid 302 form a pattern inthe shape of the letter “O” or the letter “N” and concludes that no suchpattern is formed. More specifically, an additional cell bearing thenumber forty-two needs to be daubed in order for a pattern in the shapeof the letter “O” to be formed, and two additional cells, namely theones bearing the numbers twenty-five and fifty-five, need to be daubedin order for a pattern in the shape of the letter “N” to be formedwithin the grid 302. Subsequently, the player determines whether cellsdaubed within the grid 302 form a pattern in the shape of the letter “O”or the letter “N”, and concludes that no such pattern is formed. Sincethe objective consists in daubing cells that form a pattern in the shapeof the letter “O” and another in the shape of the letter “N” within anytwo of the grid 302, grid 304, and grid 306, the player furtherconcludes that the objective is yet to be reached within the card 300.If not rushed in time, the player can determine whether cells daubedwithin the grid 306 form a pattern in the shape of the letter “O” or theletter “N” to establish the complete state of the card 300 inanticipation of subsequent draws. The player would conclude that thecells daubed within the grid 306 form a pattern in the shape of theletter “N” and therefore only the cell bearing the number forty-twoneeds to be daubed in order for the objective to be reached within thecard 300. Conversely, if rushed in time, the player can forego thisprocess in order to determine whether the objective is reached withinother active cards before the subsequent draw.

If the next number to be drawn is indeed forty-two, the player daubs thecorresponding cell, determines whether cells daubed within the grid 302form a pattern in the shape of the letter “O” or the letter “N”, andconcludes that cells daubed within the grid 302 form a pattern in theshape of the letter “O”.

Subsequently, the player determines whether cells daubed within the grid304 form a pattern in the shape of the letter “O” or the letter “N” andconcludes that no such pattern is formed. Finally, the player determineswhether cells daubed within the grid 306 form a pattern in the shape ofthe letter “O” or the letter “N” and concludes that cells daubed withinthe grid 306 form a pattern in the shape of the letter “N”.Consequently, the player can rightfully claim to have daubed cellsforming a pattern in the shape of the letter “O” and another in theshape of the letter “N” within any two of linked grids printed on thecard 300.

Referring now to FIG. 7, there is shown a flowchart illustrating amethod of operating a system for playing a bingo game in which a prizeis awarded when a pattern spanning three linked grids is daubed. Theflowchart is applicable to any of the embodiments described hereinabove.

In a step 700, three linked grids of play cells are provided to aplayer. The linked grids can be displayed on an electronic console orprinted on a bingo card. While the method is described as providingthree linked grids to the player, it can provide a different number oflinked grids in accordance with rules of the game. More than one set oflinked grids can be displayed on an electronic console or printed on abingo card, in which case those of the grids belonging to a same set arevisually distinguished from others. For instance, each set of linkedgrids can be of a different colour.

In a step 702, a pattern spanning three linked grids is displayed. Apattern is said to span several grids if it extends over several grids.The pattern is displayed on a means for displaying such as an electronicconsole, an electronic display, or a board on which the bingo operatorcan draw. Such a display informs the players of the pattern to be formedusing daubed cells belonging to a same set of linked grids.

In a step 704, one of a predetermined set of numbers is randomlyselected. The number can be automatically selected by a computer programimplementing a random number generator or by an operator activating ablower. In embodiments where at least one play cell can bear one of apredetermined set of non-numerical symbols, one of the non-numericalsymbols can alternatively be selected in the step 704.

In a step 706, the linked grids are verified to determine whether any ofthe play cells bear the number selected in the step 704. In embodimentswhere the grids are printed on a bingo card, the verification can beperformed by the player. However, in embodiments where the grids aredisplayed on electronic consoles, a computer program running on theconsole, or on a server managed by the bingo operator and communicatingwith the console, and communicating with the means for selecting canautomatically search the play cells for the selected number.

If in the step 706, at least one of the play cells is identified asbearing the selected number, and in a step 708, the identified play cellis daubed. In embodiments where the grids are printed on bingo cards,the player can daub the identified cell by applying a dauber over thesurface of the bingo card on which the identified cell is printed. Thedauber leaves an ink mark on the bingo card distinguishing theidentified play cell from those bearing a yet to be selected one of theset of numbers. However, in embodiments where the grids are displayed onelectronic consoles, a computer program running on the console, or on aserver managed by the bingo operator and communicating with the console,can assign a visual indicator automatically or in response to playerinput to the identified cell for it to be distinguished from those ofthe cells bearing a yet to be selecting one of the set of numbers.

In a step 710, it is verified whether a predetermined pattern is formedby the daubed play cells belonging of the linked grids. In embodimentswhere the grids are printed on a bingo card, the verification can beperformed by the player. However, in embodiments where the grids aredisplayed on electronic consoles, a computer program running on theconsole, or on a server managed by the bingo operator and communicatingwith the console, can automatically search the play cells for thepredetermined pattern.

If according to the verification performed in the step 710, the daubedplay cells of the linked grids form the predetermined pattern, theplayer holding the linked grids is awarded a payout in a step 712. Thepayout can be of monetary or non-monetary nature. The prize can beawarded manually, by a representative of the bingo operator, orelectronically, by a computer program having access to player accountsand triggered upon completion of the pattern.

Once the payout is awarded, the game ends in a step 714 and all gridsbecome invalid. Alternatively, only the linked grids in which thepredetermined pattern was formed become invalid and the other gridsremain valid for a subsequent game having a same or different objective.According to yet another embodiment, all grids remain valid for asubsequent game having a different objective.

However, if according to the verification performed in the step 710, thedaubed play cells of the linked grids have yet to form the predeterminedpattern, a count of number selections is incremented by one in a step716. The count is updated in order to ensure that the predeterminedpattern is formed within a maximum established in accordance with rulesof the game. However, according to another embodiment, the rules of thegame do not establish such a restriction and no count of numberselections is recorded.

In a step 718, it is verified whether the count of number selections hasreached the predetermined maximum. The verification can be performed bya representative of the bingo operator or by a computer programcommunicating with the selection means. If the maximum is reached, thegame ends in the step 714. Otherwise, the game resumes with theselection of a new number in the step 704.

Disclosed herein is a bingo game, the objective of which is defined as afunction of an arithmetic function to be satisfied by the count of cellsdaubed within each of several linked grids. The game presents distinctchallenges with respect to state monitoring as the contribution of anyone of the linked grids can not be assessed independently from those ofits brethren. According to a preferred embodiment, the first player thatrightfully claims to have a triple-faced bingo card wherein one of thegrids has precisely four daubed cells more than the least daubed grid,and another one of the grids has precisely eight daubed cells more thanthe least daubed grid, is awarded a corresponding prize. Referring toFIG. 9, there is illustrated a display 500 informing players of anarithmetic function to be satisfied, where the function is described inwords 902. Alternatively, and referring to FIG. 10, an arithmeticfunction can be described using a combination of arithmetic expressions1008 and three sample grids 1002, 1004, and 1006.

Referring to FIG. 8, there is illustrated a bingo card 800 with threelinked and horizontally aligned grids, namely a grid 802, grid 804, andgrid 806. Two play cells are daubed within the grid 802, six are daubedwithin the grid 804, and nine are daubed within the grid 806.

In order to establish the state of the bingo card 800, the playerdetermines the count of cells daubed within each of the grid 802, grid804, and grid 806. Unlike a readily identifiable pattern, such a numbercannot be ascertained from a quick glance at the card 800. Therefore,the player either counts or updates a memorized count of the cellsdaubed within each of the grids 802, 804, and 806, compares theresulting counts to determine whether the desired arithmetic function issatisfied, and concludes that the objective is yet to be reached withinthe card 800. Indeed, while the grid 804 has four daubed cells more thanthe grid 802, the grid 806 has only seven daubed cells more than thegrid 802, and therefore, one additional cell needs to be daubed withinthe grid 806 before the player can rightfully claim to have three linkedgrids satisfying the desired arithmetic function.

If the next number to be drawn is borne by a cell within the grid 806,and not borne by any of the cells within the grids 802 and 804, theplayer daubs the corresponding cell, either counts or updates amemorized count of the cells daubed within the grids 802, 804, and 806,compares the resulting counts to determine whether the desiredarithmetic function is satisfied, and concludes that the objective isreached within the card 800. Indeed, while the grid 804 has four daubedcells more than the grid 802, the grid 806 has eight daubed cells morethan the grid 802.

If however, the next number to be drawn is not exclusively borne by acell within the grid 806, the player daubs the corresponding cells, ifany, either counts or updates a memorized count of the cells daubedwithin the grids 802 and 804, compares the resulting counts to determinewhether the desired arithmetic function is satisfied, and concludes thatthe objective is yet to be reached within the card 800, regardless ofthe count of cells daubed within the grid 806. If not rushed in time,the player can determine the count of cells daubed within the grid 806to assess the complete state of the card 800 in anticipation ofsubsequent draws. Conversely, if rushed in time, the player can foregothis process in order to determine whether the objective is reachedwithin other active cards before the subsequent draw.

It is important to note that within the context of traditional bingogames, a grid either stagnates or progresses towards an objective overthe course of a session, whereas in the context of this particular game,a single daub can pull a card away from the objective. For instance, inthe case illustrated in FIG. 8, while an additional daub within the grid806 is sufficient to reach the objective, an additional daub within thegrid 804 is sufficient to pull the card 800 away from the objective.Indeed, in the latter case, three additional daubs would subsequently berequired to reach the objective, namely one within the grid 802 and twowithin the grid 806. The game provides for greater entertainment asplayers can experience several ephemeral near wins within a same cardand with respect to a same objective.

Referring now to FIG. 11, there is shown a flowchart illustrating amethod of operating a system for playing a bingo game in which a prizeis awarded when a predetermined arithmetic function is satisfied by gridcounts corresponding to three linked grids.

In a step 1100, three linked grids of play cells are provided to aplayer. The linked grids can be displayed on an electronic console orprinted on a bingo card. While the method is described as provided threelinked grids to the player, it can provide a different number of linkedgrids in accordance with rules of the game. More than one set of linkedgrids can be displayed on an electronic console or printed on a bingocard, in which case those of the grids belonging to a same set arevisually distinguished from others. For instance, each set of linkedgrids can be of a different colour.

In a step 1102, an arithmetic function to be satisfied by a count of thedaubed play cells belonging to a first of three linked grids, a count ofthe daubed play cells belonging to a second of the linked grids, and acount of the daubed play cells belonging to a third of the linked gridsis displayed. The function is displayed on a means for displaying suchas an electronic console, an electronic display, or a board on which thebingo operator can draw using chalk or a felt-tip pen. Such a displayinforms the players of the arithmetic function to be satisfied.

In a step 1104, one of a predetermined set of numbers is randomlyselected. The number can be automatically selected by a computer programimplementing a random number generator or by an operator activating ablower. In embodiments where at least one play cell can bear one of apredetermined set of non-numerical symbols, one of the non-numericalsymbols can alternatively be selected in the step 1104.

In a step 1106, the linked grids are verified to determine whether anyof the play cells bear the number selected in the step 1104. Inembodiments where the grids are printed on a bingo card, theverification can be performed by the player. However, in embodimentswhere the grids are displayed on electronic consoles, a computer programrunning on the console, or on a server managed by the bingo operator andcommunicating with the console, and communicating with the means forselecting can automatically search the play cells for the selectednumber.

If in the step 1106, at least one of the play cells is identified asbearing the selected number, and in a step 1108, the identified playcell is daubed. In embodiments where the grids are printed on bingocards, the player can daub the identified cell by applying a dauber overthe surface of the bingo card on which the identified cell is printed.The dauber leaves an ink mark on the bingo card distinguishing theidentified play cell from those bearing a yet to be selected one of theset of numbers. However, in embodiments where the grids are displayed onelectronic consoles, a computer program running on the console, or on aserver managed by the bingo operator and communicating with the console,can assign a visual indicator automatically or in response to play inputto the identified cell for it to be distinguished from those of thecells bearing a yet to be selecting one of the set of numbers.

In a step 1110, for each play cell daubed in the step 1108, acorresponding grid count is incremented. A grid count represents a totalcount of daubed play cells belonging to one of the linked grids. Inembodiments where the grids are printed on a bingo card, the grid countscan be calculated by the player. However, in embodiments where the gridsare displayed on electronic consoles, a computer program running on theconsole, or on a server managed by the bingo operator and communicatingwith the console, can automatically increment the grid counts.

In a step 1112, it is verified whether the three grid countscorresponding to the set of linked grids satisfy the arithmeticfunction. In embodiments where the grids are printed on a bingo card,the verification can be performed by the player. However, in embodimentswhere the grids are displayed on electronic consoles, a computer programrunning on the console, or on a server managed by the bingo operator andcommunicating with the console, can automatically compare the gridcounts according to the predetermined arithmetic function.

If according to the verification performed in the step 1112, the gridcounts of the linked grids satisfy the predetermined arithmeticfunction, the player holding the linked grids is awarded a payout in astep 1114. The payout can be of monetary or non-monetary nature. Theprize can be awarded manually, by a representative of the bingooperator, or electronically, by a computer program having access toplayer accounts and triggered upon satisfaction of the predeterminedarithmetic function.

Once the payout is awarded, the game ends in a step 1116 and all gridsbecome invalid. Alternatively, only the linked grids whose grid countssatisfy the predetermined arithmetic function become invalid and theother grids remain valid for a subsequent game having a same ordifferent objective. According to yet another embodiment, all gridsremain valid for a subsequent game having a different objective.

However, if according to the verification performed in the step 1112,the grid counts of the linked grids have yet to satisfy thepredetermined arithmetic function, a count of number selections isincremented by one in a step 1118. The count is updated in order toensure that the predetermined arithmetic function is satisfied within amaximum established in accordance with rules of the game. However,according to another embodiment, the rules of the game do not establishsuch a restriction and no count of number selections is recorded.

In a step 1120, it is verified whether the count of number selectionshas reached the predetermined maximum. The verification can be performedby a representative of the bingo operator or by a computer programcommunicating with the selection means. If the maximum is reached, thegame ends in the step 1116. Otherwise, the game resumes with theselection of a new number in the step 1104.

Disclosed herein is another novel bingo game, the objective of which isdefined as a function of a count of cells to be daubed within a samegrid and a last number daubed within the same grid. Within the contextof such a game, in order to establish the state of a grid, the playereither counts or keeps a count of the number of daubed cells within thegrid, and compares the resulting number with the number borne by thelast cell daubed within the same grid. Both alternatives are challengingwithin the context of simultaneously active grids, but for differentreasons. The first tries the speed at with which is counted the numberof daubed cells within each active grid, and the second, the ability tomemorize an evolving count for each active grid.

According to a preferred embodiment, the first player that rightfullyclaims to have daubed a count of cells equal to the number borne by thelast daubed cell over the course of a same session is awarded acorresponding prize. Referring to FIG. 13, there is illustrated thedisplay 500 informing players of an arithmetic function to be satisfied,where the function is described in words 1302. Alternatively, andreferring to FIG. 14, an arithmetic function can be described using acombination of a representation of a bingo ball 1404, a sample grid1402, a close-up on a play cell of interest 1406, and a grid count 1408.

Referring now to FIG. 12, there is illustrated a bingo card 1200 havinga single grid 1202, in which five out of twenty-five cells 1204 aredaubed. Furthermore, a yet to be daubed cell 1206 bears the number six.

In order to establish the state of the grid 1202, the player countsdaubed ones of the cells 1204 daubed. Unlike a readily identifiablepattern, such a number cannot be accurately ascertained from a quickglance at the grid 1202. Therefore, the player either counts or updatesa memorized count of daubed ones of the cells 1204 daubed. Subsequently,the player compares the resulting count, namely five, with the numberborne by the last cell to be daubed, namely twenty-eight, to concludethat the objective is yet to be reached within the grid 1202.

If the next number to be drawn is six, the player daubs thecorresponding cell 1206, either counts or increments a memorized countof the cells 1204 daubed, and compares the count, namely six, with thenumber borne by the last daubed cell 1206, namely six, to conclude thatthe objective is reached within the grid 1202.

However, if the next number to be drawn is borne by one of the cells1204 other than the cell 1206, the player daubs the corresponding one ofthe cells 1204 and counts or increments a memorized count of the cells1204 daubed. Since the resulting count is greater than six, the cell1206 can no longer be the sixth cell to be daubed within the grid 1202,and consequently, the objective for this particular grid shifts to thesmallest number greater than six and borne by a yet to be daubed cell.For instance, in the particular case illustrated in FIG. 12, if thenumber three is drawn, the objective shifts to the number ten. If rushedin time, and knowing that the objective has not been reached within thegrid 1202, the player can forego this process in order to determinewhether the objective is reached within other active grids before thesubsequent draw.

Alternatively, if the next number to be drawn is not borne by any of thecells 1204, the player does not daub any of the cells 1204. Since thecount of cells 1204 daubed within the grid 1202 remains unchanged andsmaller than six, the cell 1206 can still turn out be the sixth cell tobe daubed within the grid 1202, and consequently, the objective for thisparticular grid remains hinged on the number six. Consequently, theplayer would only count the cells 1204 daubed to identify the numberupon which the objective hinges in anticipation of subsequently drawnnumbers. If rushed in time, and knowing that the objective has not beenreached within the grid 1202, the player can forego this process inorder to determine whether the objective is reached within other activegrids before the subsequent draw.

While the game has been described as presenting an objective to bereached within an individual grid, it can very well present an objectiveto be reached within several linked grids, wherein the objective isdefined as a function of a total count of cells daubed within the gridsand a number borne by the last cell daubed within the linked grids. Inthis particular embodiment, the player encounters greater difficulty inestablishing the state of the grids as the objective can be reached bycombining contributions provided by more than one grid.

Referring now to FIG. 15, there is shown a flowchart illustrating amethod of operating a system for playing a bingo game in which a prizeis awarded when an arithmetic function is satisfied by a grid count anda number borne by a last daubed cell.

In a step 1500, a grid of play cells is provided to a player. The gridcan be displayed on an electronic console or printed on a bingo card.While the method is described as providing a grid to the player, it canprovide a greater number of grids in accordance with rules of the game.More than one grid can be displayed on an electronic console or printedon a bingo card.

In a step 1502, an arithmetic function to be satisfied by a grid countand a number borne by a last daubed cell is displayed. The function isdisplayed on a means for displaying such as an electronic console, anelectronic display, or a board on which the bingo operator can drawusing chalk or a felt-tip pen. Such a display informs the players of thearithmetic function to be satisfied.

In a step 1504, one of a predetermined set of numbers is randomlyselected. The number can be automatically selected by a computer programimplementing a random number generator or by an operator activating ablower. In embodiments where at least one play cell can bear one of apredetermined set of non-numerical symbols, one of the non-numericalsymbols can alternatively be selected in the step 1504.

In a step 1506, the grid is verified to determine whether any of theplay cells bear the number selected in the step 1504. In embodimentswhere the grid is printed on a bingo card, the verification can beperformed by the player. However, in embodiments where the grid isdisplayed on electronic consoles, a computer program running on theconsole, or on a server managed by the bingo operator and communicatingwith the console, and communicating with the means for selecting canautomatically search the play cells for the selected number.

If in the step 1506, at least one of the play cells is identified asbearing the selected number, and in a step 1508, the identified playcell is daubed. In embodiments where the grid is printed on a bingocard, the player can daub the identified cell by applying a dauber overthe surface of the bingo card on which the identified cell is printed.The dauber leaves an ink mark on the bingo card distinguishing theidentified play cell from those bearing a yet to be selected one of theset of numbers. However, in embodiments where the grid is displayed onelectronic consoles, a computer program running on the console, or on aserver managed by the bingo operator and communicating with the console,can assign a visual indicator automatically or in response to play inputto the identified cell for it to be distinguished from those of thecells bearing a yet to be selecting one of the set of numbers.

In a step 1510, for each play cell daubed in the step 1508, acorresponding grid count is incremented. A grid count represents a totalcount of daubed play cells belonging to the grid. In embodiments wherethe grid is printed on a bingo card, the grid count can be calculated bythe player. However, in embodiments where the grid is displayed onelectronic consoles, a computer program running on the console, or on aserver managed by the bingo operator and communicating with the console,can automatically increment the grid count.

In a step 1512, it is verified whether the grid count and the numberselected in the step 1504 satisfy the predetermined arithmetic function.In embodiments where the grid is printed on a bingo card, theverification can be performed by the player. However, in embodimentswhere the grid is displayed on electronic consoles, a computer programrunning on the console, or on a server managed by the bingo operator andcommunicating with the console, can automatically compare the grid countand the number selected in the step 1504 according to the predeterminedarithmetic function.

If according to the verification performed in the step 1512, the gridcount and the number selected in the step 1504 satisfy the predeterminedarithmetic function, the player holding the grid is awarded a payout ina step 1514. The payout can be of monetary or non-monetary nature. Theprize can be awarded manually, by a representative of the bingooperator, or electronically, by a computer program having access toplayer accounts and triggered upon satisfaction of the predeterminedarithmetic function.

Once the payout is awarded, the game ends in a step 1516 and all gridsbecome invalid. Alternatively, only the grid whose grid count satisfiesthe predetermined arithmetic function with the number selected in thestep 1504 becomes invalid and the other grids remain valid for asubsequent game having a same or different objective. According to yetanother embodiment, all grids remain valid for a subsequent game havinga different objective.

However, if according to the verification performed in the step 1512,the grid count has yet to satisfy the predetermined arithmetic functionalong with the number selected in the step 1504, a count of numberselections is incremented by one in a step 1518. The count is updated inorder to ensure that the predetermined arithmetic function is satisfiedwithin a maximum established in accordance with rules of the game.However, according to another embodiment, the rules of the game do notestablish such a restriction and no count of number selections isrecorded.

In a step 1520, it is verified whether the count of number selectionshas reached the predetermined maximum. The verification can be performedby a representative of the bingo operator or by a computer programcommunicating with the selection means. If the maximum is reached, thegame ends in the step 1516. Otherwise, the game resumes with theselection of a new number in the step 1504.

At least some novice and experienced players look to increase the oddsof winning a prize by purchasing a greater number of grids. There istherefore a need for a system that allows novice and experienced playersto monitor the state of a greater number of simultaneously active grids,particularly within the context of games such as those described hereinabove, wherein states are not readily identifiable within cards.

Disclosed herein is a system for recording and displaying values of oneor more parameters defining the state of a grid or several linked grids.Herein below, the system is described within the context of a bingogame, the objective of which is defined as a function of a number ofdaubed cells bearing a same attribute designation, also known as anauxiliary symbol, but can very well be applied within the context ofother games.

Referring now to FIG. 4, there is illustrated a bingo card 400 withthree linked grids, namely a grid 402, grid 404, and grid 406. Somecells are endowed with a hare attribute designation 410 and others areendowed with a tortoise attribute designation 408. At the bottom of thecard 400, beneath the grids 402, 404, and 406, are printed a grid 412comprised of ten cells and associated to the hare attribute designation410, as well as a grid 414 comprised of ten cells and associated to thetortoise attribute designation 408.

The attribute designation 408 and attribute designation 410 aredisplayed within the grids 402, 404, and 406 for the purposes of aparticular bingo game, the objective of which consists in being thefirst to have daubed ten cells bearing a same one of the attributedesignation 408 and attribute designation 410 within a same series oflinked grids. Within the context of such a game, the parameter valuesdefining the states of the grids 402, 404, and 406 consist in the countof daubed cells bearing the attribute designation 408, and the count ofdaubed cells bearing the attribute designation 410.

In order to establish the state of the bingo card 400, the playerdetermines the number of daubed cells bearing a same one of theattribute designations 408 and 410 within the grids 402, 404, and 406.Unlike a readily identifiable pattern, such a number cannot beascertained from a quick glance at the card 400, at least partiallybecause there are two types of attribute designations, namely theattribute designations 408 and 410, and because the attributedesignations are randomly scattered across the grids 402, 404, and 406.Therefore, the player either counts or updates memorized counts ofdaubed cells bearing a same one of the attribute designations 408 and410 within the grids 402, 404, and 406, and determines whether any ofthe resulting counts have reached the number ten.

Alternatively, the player can monitor the state of the bingo card 400 bydaubing a cell within a corresponding one of the grids 412 and 414 foreach cell daubed within one of the grids 402, 404, and 406 bearing oneof the attribute designations 408 and 410. For instance, if the numberten is drawn, the player daubs the cell within the grid 402 bearing thenumber ten and a first cell within the grid 412. Subsequently, theplayer daubs the cell within the grid 406 bearing the number ten and asecond cell within the grid 412.

Not only is the action of daubing cells within the grids 412 and 414entertaining, but it also enables players to readily monitor within thegrids 412 and 414 the number of daubed cells bearing a same one of theattribute designation 408 and attribute designation 410, as well as thecount of cells bearing a same one of the attribute designation 408 andattribute designation 410 to be daubed in order for the desiredobjectives to be reached within the card 400. As a result, in caseswhere few cells need to be daubed in order for the objective to bereached, the corresponding near win situation is brought to theattention of the player within the grids 412 and 414, thereby increasinginterest in subsequent draws in anticipation of an eventual win.

According to one embodiment, the count of cells bearing the attributedesignation 408 equals the count of cells of the grid 412, and the countof cells bearing the number 410 equals the count of cells of the grid414. The objective of the game is defined as a function of apredetermined number of daubed cells within a first predetermined subsetof cells, namely those to which the attribute designation 408 isassigned, and as a function of a predetermined number of daubed cellswithin a second predetermined subset of cells, namely those to which theattribute designation 410 is assigned.

According to another embodiment, the count of cells bearing theattribute designation 408 is greater than the count of cells of the grid412, and the count of cells bearing the attribute designation 410 isgreater than the count of cells of the grid 414. The objective of thegame is defined as a function of two predetermined patterns extendingover more than one of several linked grids, the first predeterminedpattern consisting in cells to which the attribute designation 408 isassigned, and the second predetermined pattern consisting in cells towhich the attribute designation 410 is assigned.

According to one embodiment, an equal count of cells bear a same one ofthe attribute designations 408 and 410. However, according to anotherembodiment, the count of cells bearing a first one of the attributedesignation 408 and 410 is greater than the count of cells bearing thesecond one of the attribute designations 408 and 410.

According to one embodiment, the grids 412 and 414 include an equalcount of cells. However, according to another embodiment, a first one ofthe grids 412 and 414 includes a greater count of cells than the secondone of the grids 412 and 414.

The cells of the grids 412 and 414 have been described as trackingcells, namely ones that provide an indication as to a count of daubedcells endowed with a corresponding one of the symbols 408 and 410.However, according to another embodiment, the cells of the grids 412 and414 can be used as conversion cells, namely ones that reflect the valueof each one of the symbols 408 and 410 with respect to an objective ofthe game.

According to the embodiments where the cells of the grids 412 and 414are used as conversion cells instead of tracking cells, the player daubsa first predetermined count of different ones of the cells of the grid412 for each daubed play cell endowed with the attribute designation 408according to the rules of the game. Similarly, the player daubs a secondpredetermined count of different ones of the cells of the grid 414 foreach daubed play cell endowed with the attribute designation 410according to the rules of the game. A first prize is awarded when eachone of the cells of the grid 412 is daubed. A second prize is awardedwhen each one of the cells of the grid 414 is daubed. The first andsecond predetermined counts are established in accordance with rules ofthe game, and can be equal or unequal. The first and second prizes areestablished in accordance with rules of the game and can be equal orunequal. For instance, the first predetermined count can be greater thanthe second predetermined count, and the second prize can be greater thanthe first prize.

While the game has been described as involving two types of attributedesignations, namely the attribute designations 408 and 410, it can verywell involve a single attribute designation or more than two attributedesignations. Also, while a single attribute designation, namely theattribute designation 408, is assigned to all cells of the grid 412, anda single attribute designation, namely the attribute designation 410, isassigned to all cells of the grid 414, more than one attributedesignation can be assigned to a single cell.

While a same attribute designation, namely the attribute designation408, is assigned to all cells of the grid 412, and a single attributedesignation, namely the attribute designation 410, is assigned to allcells of the grid 414, a different attribute designation can be assignedto at least some of the cells of a same grid. According to oneembodiment, a different attribute designation is assigned to at leastsome of the cells of a same grid, and when the player daubs a grid cellbearing an attribute designation, the player can daub no more than onegrid cell, or no more than a predetermined count of cells to which theattribute designation is assigned. According to one embodiment, adifferent attribute designation is assigned to at least some of thecells of a same grid, and when the player daubs a grid cell bearing anattribute designation, the player can daub all grid cells to which theattribute designation is assigned.

According to one embodiment, a word is selected by the bingo operator,each letter of the word is assigned to a cell of the grid 412 such thatthe cells of the grid 412 spell the word, and each letter of thealphabet included in the word corresponds to a type of attributedesignation borne by cells of the grids 402, 404, and 406. For instance,if the selected word is CHOCOLATE, the grid 412 would include ninecells, one for each letter of the word, and the cells of the grids 402,404, and 406 would involve seven types of attribute designations, onefor each letter of the alphabet included in CHOCOLATE. According to oneembodiment, when the player daubs a cell of any one of the grids 402,404, and 406 bearing the letter C or O, the player can daub only one ofthe two cells of the grid 412 to which the letter was assigned. However,according to another embodiment, the player can daub both cells of thegrid 412 to which the letter is assigned.

The cells of the grids 412 and 414 have been described as trackingcells, namely ones that provide an indication as to a count of daubedcells endowed with a corresponding one of the symbols 408 and 410.However, according to another embodiment, the cells of the grids 412 and414 can be used as conversion cells, namely ones that reflect the valueof each one of the symbols 408 and 410 with respect to an objective ofthe game.

According to the embodiments where the cells of the grids 412 and 414are used as conversion cells instead of tracking cells, the player daubsa first predetermined count of different ones of the cells of the grid412 for each daubed play cell endowed with the attribute designation 408according to the rules of the game. Similarly, the player daubs a secondpredetermined count of different ones of the cells of the grid 414 foreach daubed play cell endowed with the attribute designation 410according to the rules of the game. A first prize is awarded when eachone of the cells of the grid 412 is daubed. A second prize is awardedwhen each one of the cells of the grid 414 is daubed. The first andsecond predetermined counts are established in accordance with rules ofthe game, and can be equal or unequal. The first and second prizes areestablished in accordance with rules of the game and can be equal orunequal. For instance, the first predetermined count can be greater thanthe second predetermined count, and the second prize can be greater thanthe first prize.

Referring now to FIG. 17, there is shown a flowchart illustrating amethod of playing a bingo game on a bingo card having one M×N grid ofplay cells and another grid of tracking cells, each one of M and N beinggreater than two. A prize is awarded to a player holding the grid wheneach one of the tracking cells is daubed.

In a step 1700, the grids of play cells and tracking cells are providedto a player. The grids can be displayed on an electronic console orprinted on a bingo card. While the method is described as providing onegrid of play cells to the player, it can provide a greater number ofgrids of play cells in accordance with rules of the game. Similarly,while the method is described as providing one grid of tracking cells tothe player, it can provide a greater number of grids of tracking cellsin accordance with rules of the game. More than one grid of play cellscan be displayed on an electronic console or printed on a bingo card.Similarly, more than one grid of play cells can be displayed on anelectronic console or printed on a bingo card.

In a step 1702, a pattern spanning three linked grids is displayed. Apattern is said to span several grids if it extends over several grids.The pattern is displayed on a means for displaying such as an electronicconsole, an electronic display, or a board on which the bingo operatorcan draw. Such a display informs the players of the pattern to be formedusing daubed cells belonging to a same set of linked grids.

In a step 1704, one of a predetermined set of numbers is randomlyselected. The number can be automatically selected by a computer programimplementing a random number generator or by an operator activating ablower. In embodiments where at least one play cell can bear one of apredetermined set of non-numerical symbols, one of the non-numericalsymbols can alternatively be selected in the step 1704.

In a step 1706, the grid is verified to determine whether any of theplay cells bear the number selected in the step 1704. In embodimentswhere the grid is printed on a bingo card, the verification can beperformed by the player.

However, in embodiments where the grid is displayed on electronicconsoles, a computer program running on the console, or on a servermanaged by the bingo operator and communicating with the console, andcommunicating with the means for selecting can automatically search theplay cells for the selected number.

If in the step 1706, at least one of the play cells is identified asbearing the selected number, and in a step 1708, the identified playcell is daubed. In embodiments where the grid is printed on a bingocard, the player can daub the identified cell by applying a dauber overthe surface of the bingo card on which the identified cell is printed.The dauber leaves an ink mark on the bingo card distinguishing theidentified play cell from those bearing a yet to be selected one of theset of numbers. However, in embodiments where the grid is displayed onelectronic consoles, a computer program running on the console, or on aserver managed by the bingo operator and communicating with the console,can assign a visual indicator automatically or in response to play inputto the identified cell for it to be distinguished from those of thecells bearing a yet to be selecting one of the set of numbers.

In a step 1710, for each play cell daubed in the step 1708, it isdetermined whether the play cell daubed in the step 1708 is endowed withan attribute designation. In embodiments where the grid is printed on abingo card, the verification can be performed by the player. However, inembodiments where the grid is displayed on electronic consoles, acomputer program running on the console, or on a server managed by thebingo operator and communicating with the console, can automaticallyperform the verification.

If in the step 1710, the play cell is identified as bearing theattribute designation, and in a step 1712, one of the tracking cells isdaubed. In embodiments where the grid is printed on a bingo card, theplayer can daub a tracking cell by applying a dauber over the surface ofthe bingo card on which an available one of the tracking cells isprinted. The dauber leaves an ink mark on the bingo card distinguishingthe tracking cell from those that have yet to be daubed. However, inembodiments where the grid is displayed on electronic consoles, acomputer program running on the console, or on a server managed by thebingo operator and communicating with the console, can assign a visualindicator automatically or in response to play input to an availabletracking cell for it to be distinguished from those of the trackingcells that remain available.

In a step 1714, it is verified whether each one of the tracking cellshas been daubed. In embodiments where the grids are printed on a bingocard, the verification can be performed by the player. However, inembodiments where the grids are displayed on electronic consoles, acomputer program running on the console, or on a server managed by thebingo operator and communicating with the console, can automaticallysearch for an available tracking cell.

If according to the verification performed in the step 1714, each one ofthe tracking cells has been daubed, the player holding the grid isawarded a payout in a step 1716. The payout can be of monetary ornon-monetary nature. The prize can be awarded manually, by arepresentative of the bingo operator, or electronically, by a computerprogram having access to player accounts and triggered once the last oneof the available tracking cells has been daubed.

Once the payout is awarded, the game ends in a step 1718 and all gridsof play cells become invalid. Alternatively, only the grid of play cellsfor which all tracking cells have been daubed becomes invalid, and theother grids remain valid for a subsequent game having a same ordifferent objective. According to yet another embodiment, all gridsremain valid for a subsequent game having a different objective.

However, if according to the verification performed in the step 1714, atleast one of the tracking cells remains available, a count of numberselections is incremented by one in a step 1720. The count is updated inorder to ensure that the predetermined arithmetic function is satisfiedwithin a maximum established in accordance with rules of the game.However, according to another embodiment, the rules of the game do notestablish such a restriction and no count of number selections isrecorded.

In a step 1722, it is verified whether the count of number selectionshas reached the predetermined maximum. The verification can be performedby a representative of the bingo operator or by a computer programcommunicating with the selection means. If the maximum is reached, thegame ends in the step 1718. Otherwise, the game resumes with theselection of a new number in the step 1704.

Referring now to FIG. 16, there is shown a flowchart illustrating amethod of playing a bingo game on a bingo card having one M×N grid ofplay cells and another grid of conversion cells, each one of M and Nbeing greater than two. A prize is awarded to a player holding the gridwhen each one of the conversion cells is daubed.

In a step 1600, the grids of play cells and conversion cells areprovided to a player. The grids can be displayed on an electronicconsole or printed on a bingo card. While the method is described asproviding one grid of play cells to the player, it can provide a greaternumber of grids of play cells in accordance with rules of the game.Similarly, while the method is described as providing one grid ofconversion cells to the player, it can provide a greater number of gridsof conversion cells in accordance with rules of the game. More than onegrid of play cells can be displayed on an electronic console or printedon a bingo card. Similarly, more than one grid of play cells can bedisplayed on an electronic console or printed on a bingo card.

In a step 1602, a pattern spanning three linked grids is displayed. Apattern is said to span several grids if it extends over several grids.The pattern is displayed on a means for displaying such as an electronicconsole, an electronic display, or a board on which the bingo operatorcan draw. Such a display informs the players of the pattern to be formedusing daubed cells belonging to a same set of linked grids.

In a step 1604, one of a predetermined set of numbers is randomlyselected. The number can be automatically selected by a computer programimplementing a random number generator or by an operator activating ablower. In embodiments where at least one play cell can bear one of apredetermined set of non-numerical symbols, one of the non-numericalsymbols can alternatively be selected in the step 1604.

In a step 1606, the grid is verified to determine whether any of theplay cells bear the number selected in the step 1604. In embodimentswhere the grid is printed on a bingo card, the verification can beperformed by the player. However, in embodiments where the grid isdisplayed on electronic consoles, a computer program running on theconsole, or on a server managed by the bingo operator and communicatingwith the console, and communicating with the means for selecting canautomatically search the play cells for the selected number.

If in the step 1606, at least one of the play cells is identified asbearing the selected number, and in a step 1608, the identified playcell is daubed. In embodiments where the grid is printed on a bingocard, the player can daub the identified cell by applying a dauber overthe surface of the bingo card on which the identified cell is printed.The dauber leaves an ink mark on the bingo card distinguishing theidentified play cell from those bearing a yet to be selected one of theset of numbers. However, in embodiments where the grid is displayed onelectronic consoles, a computer program running on the console, or on aserver managed by the bingo operator and communicating with the console,can assign a visual indicator automatically or in response to play inputto the identified cell for it to be distinguished from those of thecells bearing a yet to be selecting one of the set of numbers.

In a step 1610, for each play cell daubed in the step 1608, it isdetermined whether the play cell daubed in the step 1608 is endowed withan attribute designation. In embodiments where the grid is printed on abingo card, the verification can be performed by the player. However, inembodiments where the grid is displayed on electronic consoles, acomputer program running on the console, or on a server managed by thebingo operator and communicating with the console, can automaticallyperform the verification.

If in the step 1610, the play cell is identified as bearing theattribute designation, and in a step 1612, a predetermined count of theconversion cells is daubed. In embodiments where the grid is printed ona bingo card, the player can daub conversion cells by applying a dauberover the surface of the bingo card on which available ones of theconversion cells is printed. The dauber leaves an ink mark on the bingocard distinguishing the conversion cells from those that have yet to bedaubed. However, in embodiments where the grid is displayed onelectronic consoles, a computer program running on the console, or on aserver managed by the bingo operator and communicating with the console,can assign a visual indicator automatically or in response to play inputto available conversion cells for them to be distinguished from those ofthe conversion cells that remain available.

In a step 1614, it is verified whether each one of the conversion cellshas been daubed. In embodiments where the grids are printed on a bingocard, the verification can be performed by the player. However, inembodiments where the grids are displayed on electronic consoles, acomputer program running on the console, or on a server managed by thebingo operator and communicating with the console, can automaticallysearch for an available conversion cell.

If according to the verification performed in the step 1614, each one ofthe conversion cells has been daubed, the player holding the grid isawarded a payout in a step 1616. The payout can be of monetary ornon-monetary nature. The prize can be awarded manually, by arepresentative of the bingo operator, or electronically, by a computerprogram having access to player accounts and triggered once the last oneof the available conversion cells has been daubed.

Once the payout is awarded, the game ends in a step 1618 and all gridsof play cells become invalid. Alternatively, only the grid of play cellsfor which all conversion cells have been daubed becomes invalid, and theother grids remain valid for a subsequent game having a same ordifferent objective. According to yet another embodiment, all gridsremain valid for a subsequent game having a different objective.

However, if according to the verification performed in the step 1614, atleast one of the conversion cells remains available, a count of numberselections is incremented by one in a step 1620. The count is updated inorder to ensure that the predetermined arithmetic function is satisfiedwithin a maximum established in accordance with rules of the game.However, according to another embodiment, the rules of the game do notestablish such a restriction and no count of number selections isrecorded.

In a step 1622, it is verified whether the count of number selectionshas reached the predetermined maximum. The verification can be performedby a representative of the bingo operator or by a computer programcommunicating with the selection means. If the maximum is reached, thegame ends in the step 1618. Otherwise, the game resumes with theselection of a new number in the step 1604.

The systems for operating the bingo games and the method of playing thebingo games have been described within the context of both paper andelectronic versions. While the paper versions provide for a static bingocard, electronic versions enable dynamic evolution of a same bingo cardover the course of a game. Within the context of an electronic version,each player can be provided with a client device, such as an electronicconsole, connected to a game server. The connection can be establishedover a public network such as the Internet, or a private networkmaintained by the bingo operator.

Referring now to FIG. 18, there is illustrated a block diagram of anelectronic system for recording and displaying a number of daubed cellsbearing a same attribute designation and for dynamically modifying thecontent of grids of play cells over the course of a game session. Thesystem is described herein below with reference to FIG. 4 and as appliedto the linked grids of play cells 402, 404, and 406.

Prior to the activation of a bingo session, the player purchases a bingoID number from the bingo operator and enters the ID number within theinterface of a client 1802. A user interface controller 1804 providesthe entered ID number to a server interface controller 1806, whichretrieves the client numbers from a bingo card numbers database 1808,and stores the retrieved client numbers within a client numbers database1814. Each client number identifies the card 400, one of the linkedgrids 402, 404, and 406, a cell within the identified one of the grids402, 404, and 406, as well as a number borne by the identified cell.Furthermore, the user interface controller 1804 retrieves the clientattribute designations from a bingo card attribute designations database1810 and stores the retrieved client attribute designations within theclient attribute designations database 1816. Each client attributeidentifies the card 400, one of the linked grids 402, 404, and 406, acell within the identified grid, as well as one of the attributedesignations 408 and attribute designation 410. The user interfacecontroller 1804 retrieves the client numbers from the client numbersdatabase 1814, retrieves the client attribute designations from theclient attribute designations database 1816, and displays the linkedgrids 402, 404, and 406 within the interface of the client 1802.

Once the bingo operator activates the game session, a random numbergenerator 1818 provides a random number between one and seventy-five toa number dauber 1820 and an attribute search engine 1822. The randomnumber generator 1818 does not provide the same number twice within thecourse of a same session. The number dauber 1820 searches through theclient numbers stored within the client numbers database 1814 andassigns an electronic daub to each cell bearing the drawn number. As forthe attribute search engine 1822, it searches through the clientattribute designations stored within the client attribute designationsdatabase 1816 and provides an increment signal to an attribute counter1824 for each identified one of the attribute designations 408 and 410associated to the drawn number. The attribute counter 1824 holds a countof the count of daubed cells bearing the attribute designation 408 aswell as a count of those bearing the attribute designation 410. It isimportant to note that the increment signal identifies the count to beincremented. The user interface controller 1804 retrieves the daubsstored within the client numbers database 1814, and for each retrieveddaub, displays a visual indicator within the interface of the client1802. Furthermore, the user interface controller 1804 retrieves theattribute counts from the attribute counter 1824 and, for each retrievedcount, displays a corresponding number of daubs within a correspondingone of the grids 412 and 414.

The server 1800 also comprises a random attribute generator 1812periodically triggered by a timer 1826 over the course of a session toretrieve from the bingo card numbers database 1808 grid daub positions,and store random client attribute designations in the bingo cardattribute designations database 1810 to some of those of the play cellsthat have yet to be daubed. The server interface controller 1806retrieves newly stored client attribute designations and stores them inthe client attribute designations database 1816. The user interfacecontroller 1804 retrieves the newly stored client attribute designationsfrom the client attribute designations database 1816 and updates thedisplay of the linked grids 402, 404, and 406 accordingly within theinterface of the client 1802. As a result, the linked grids 402, 404,and 406 dynamically evolve over the course of a session, therebypresenting players with a greater variety of content.

According to one embodiment, the random attribute generator 1812 storesrandom client attribute designations in the bingo card attributedesignations database 1810 over the course of a session without anyrestrictions with respect to the number of client attribute designationsassigned within a grid or a series of linked grids, or the positions ofthe attribute designations within a grid or a set of linked grids.

According to another embodiment, the random attribute generator 1812stores random client attribute designations in the bingo card attributedesignations database 1810 according to a set of restrictions. Accordingto one embodiment, the restrictions limit the number of client attributedesignations that can be assigned to a grid or a series of linked grids.According to one embodiment, the restriction limits the grid cells towhich client attribute designations can be assigned. According to oneembodiment, the restrictions prevent the probability of a favourableoutcome within a grid or a series of linked grids from deviating in asubstantial manner. According to one embodiment, the restrictions ensurethat all grids or series of grids enjoy an equal probability of reachingthe desired objective before the first number is drawn. According to oneembodiment, an event over the course of a session such as a bonustrigger alters the restrictions or their applicability, thereby enablingthe random number generator 1812 to store client attribute designationsin a manner that substantially increases the probably of a favourableoutcome within a grid or a series of linked grids.

Referring now to FIG. 19, there is illustrated a block diagram of anelectronic system for recording and providing an indication as to theprobability of a favourable outcome with respect to grids of play cells.The system is described herein below with reference to FIG. 4 and asapplied to the grids 402, 404, and 406. For the purposes of thedescription of the block diagram illustrated in FIG. 19, the grids 402,404, and 406 will be considered independent from one another.

The user interface controller 1804 of each client connected to theserver 1800, such as the client 1802, provides the grid daubs andattribute counts to the server interface controller 1806, which in turnstores the daubs and the ID number in a grid daubs database 1900 andstores the attribute counts and ID number in an attribute countsdatabase 1918, wherein each daub identifies the card 400, a specific oneof the grids 402, 404, and 406, as well as a specific cell within theidentified one of the grids 402, 404, and 406.

A progress tracker 1920 retrieves the daubs and ID numbers from thedaubs database 1900, the attribute counts and ID numbers from theattribute counts database 1918, the attribute positions and ID numbersfrom the bingo card attribute designations database 1810, as well as acurrent pattern from a patterns database 1922, wherein the currentpattern defines the objective of the game. For each retrieved ID number,the tracker 1920 determines the corresponding probability of afavourable outcome, namely the near win value, and provides the lattervalue along with the corresponding ID number to a feature controller1924. The aforementioned probability is determined by comparing theprogress of a card towards the current pattern with that of the othercards.

The feature controller 1924 retrieves a visual feature representative ofthe near win value from a features database 1926 and provides theretrieved feature to the server interface controller 1806 of theappropriate client, namely the one running the bingo card having amatching ID number. The server interface controller 1806 provides thefeature to the user interface controller 1804 in order for the interfaceof the client to be updated accordingly.

According to another embodiment, the client 1802 is a code scannermounted on a table at a specific play position. The code scanner readsID numbers of bingo cards held by a player seated at the correspondingplay position, and provides the ID number to the server 1800. Thefeature controller 1924 provides the feature signal to the scanner, inorder for the play position to be distinguished from others according tothe near win value of the card held by the player seated at the playposition.

According to one embodiment, the feature controller 1924 provides thefeature signal to a seat corresponding to the play position in order forthe seat to light up. The feature controller 1924 can also provide thefeature signal to a seat corresponding to the play position in order forthe seat to emit a distinctive sound signal. The feature controller 1924can also provide the feature to a spotlight controller in order for alamp to be directed towards the play position, and where the playposition would be distinguished by a spotlight.

According to a preferred embodiment, the feature consists in a specificcolour, and the cards found to be in near win situations are displayedin red. According to another embodiment, the feature consists in ablinking indicator displayed on cards that are found to be in a near winsituation. According to yet another embodiment, the feature consists ina scale to be displayed on the cards, wherein the scale provides anindication as to the probability of a favourable outcome. According toanother embodiment, the feature consists in an audio-visual signal.

The traditional bingo game can be perceived as a race to a predeterminedpattern, wherein each active grid competes with all other active grids.Understandably, the player that runs several grids simultaneously losesinterest in those that fall significantly behind the others.Consequently, over the course of a session, the game becomes lesschallenging as fewer grids are monitored. However, within the context ofthe game illustrated in FIG. 4, the linked grids 402, 404, and 406contribute collectively towards a desired objective, which consists inreaching a desired number of daubed cells bearing a same one of theattribute designations 408 and 410. As a result, instead of competingwith each other, the grids 402, 404, and 406 collaborate to drive a racebetween the attribute designations 408 and 410.

The grids 412 and 414 enable the player to readily compare the number ofplay cells bearing the attribute designation 408 and the count of cellsbearing the attribute designation 410, thereby bringing the race betweenthe attribute designations 408 and 410 to the attention of the player,and simplifying the manner in which the race is monitored. The twoaforementioned advantages are accentuated in the embodiment illustratedin FIG. 4 as the grids 412 and 414 are each comprised of a same count ofcells and disposed alongside each other.

According to one embodiment, the cells to which attribute designationsare assigned can be selected or configured to customize the manner inwhich the number of daubed cells bearing a same attribute progressestowards the desired objective. For instance, in the context of the gameillustrated in FIG. 4, and according to one embodiment, for every cellbelonging to any one of the grids 402, 404, and 406 and to which theattribute designation 410 is assigned, there is a cell belonging to eachof the two other ones of the grids 402, 404, and 406 bearing the samenumber and to which the attribute designation 410 is assigned. However,for every cell to which the attribute designation 408 is assigned, thereis no other cell bearing the same number and to which the attributedesignation 408 is assigned. Furthermore, the attribute designation 408is assigned to as many cells as the attribute designation 410 within thegrids 402, 404, and 406. As a result, the count of daubed cells bearingthe attribute designation 408, which represents the tortoise, is likelyto progress more frequently, but at a pace of either one cell or no cellper drawn number. Conversely, the count of daubed cells bearing theattribute designation 410, which represents the hare, is likely toprogress less frequently, but at a pace of either three cells or nocells per drawn number. This particular configuration replicates theprogress of the hare and the tortoise described within the fable titledThe Hare and the Tortoise.

According to one embodiment, the grids 412 and 414 are comprised of anequal count of cells and the count of cells is adjusted in order tocustomize the probability of a favourable outcome with respect to amaximum count of drawn numbers within which the objectives are to bereached, the minimal count of drawn numbers before the objective can bereached, the average count of drawn numbers required before theobjective is reached, or the probability that a favourable outcome isreached within any one of the grids 412 and 414 before it is reachedwithin another one of the grids 412 and 414. According to anotherembodiment, the count of cells comprised within the grid 412 isdifferent from the count of cells comprised within the grid 414 in orderfor the aforementioned customization to be achieved.

In traditional bingo games, the player can only claim to have reached adesired objective by calling out “BINGO”, a limitation that contributesto the redundancy of the game. Furthermore, within the context of bingogames wherein several objectives are available simultaneously, asopposed to sequentially, the call-out does not identify the objectivethat has been allegedly reached.

Disclosed herein is a novel method of operating a bingo game whereindifferent call-outs are used over the course of a same session. Themethod comprises providing players with a plurality of call-outs overthe course of a bingo session, identifying a player that uses one of thecall-outs, and verifying the active bingo cards of the identified callerto determine whether an objective is reached within one of the cards ofthe caller.

According to one embodiment, the call-outs are provided at the beginningof a session and valid for the entire session. According to anotherembodiment, the call-outs are provided at the beginning of a session,each of which is valid for the entire session until it is rightfullyused by a player. In other words, when a player rightfully claims tohave reached an objective, the call-out used by the player is retiredfor the remainder of the session. However, when a player mistakenlyclaims to have reached a desired objective, the call-out used by theplayer remains valid for the remainder of the session.

According to yet another embodiment, a different call-out is assigned toeach of two objectives that are simultaneously available over the courseof a session. For instance, within the context of the embodimentillustrated in FIG. 4, players can only claim to have daubed ten cellsbearing the attribute designation 408 by calling out “TORTOISE”, and tencells bearing the attribute designation 410 by calling out “HARE”. As aresult, a call-out identifies a corresponding one of the two objectives,and players other than the caller can concentrate their verificationefforts on the identified objective as the caller walks up to theoperator to present the card.

According to yet another embodiment, participating players are dividedinto groups, each of which is assigned a different call-out, or a seriesthereof, wherein a player can only claim to have reached a desiredobjective by using the call-out assigned to the group to which theplayer belongs. For instance, players can be divided as a function oftheir gender or the position of their seat within a bingo hall.

As mentioned herein above, bingo games are typically hosted in bingohalls wherein each player purchases a bingo kit comprised of severalbingo cards, joins other players at one of several tables, and lays thepurchased cards on the table in a configuration adapted for monitoringpurposes. In other versions of bingo games, each player is provided witha client device on which purchased bingo cards are displayed. In bothcases, the surface of bingo cards, and therefore, that of bingo grids,is limited by logistical considerations such as the table surface madeavailable to players or the display surface of client devices providedthereto. Considering the aforementioned limitations, the count of cellsto be displayed within a grid, and the importance of readability withinthe context of bingo games, each number occupies most of the surface ofthe cell to which it is assigned, leaving little room for attributedesignations. However, the addition of such attribute designations isdesirable as it provides for a greater variety of bingo games.

Disclosed herein is a bingo card with a grid having twenty-five cells,twenty-four of which bear numbers, and some of which bear an attributethat neither interferes with the readability of the numbers nornecessitates a substantial amount of additional surface. This isachieved by stretching the outer boundary of peripheral cells outwardlywith respect to the grid, and displaying the attribute within thestretched boundaries, wherein the peripheral cells are those of thecells that are located at the periphery of the grid, the attribute issized for readability, the outer boundary is sufficiently stretched toreceive the attribute, and the outer boundary is not stretched beyondthe needs of the attribute.

According to one embodiment, the outer boundary of each peripheral cellis stretched outwardly. This embodiment is particularly advantageous forthe purposes of printing bingo cards wherein those of the peripheralcells to which the attribute is added vary from one card to the next.According to another embodiment, only those of the peripheral cells thatreceive an attribute have their outer boundary stretched, therebyminimizing the surface occupied by the grid. In the particularembodiment illustrated in FIG. 4, the addition of the attributedesignation 408 and attribute designation 410 is restricted to those ofthe peripheral cells located in the first and last column, as well asthose located in the last row, to avoid interference with the letters ofthe word “BINGO” assigned to each column. Furthermore, only those of theperipheral cells that receive an attribute have their outer boundarystretched, thereby minimizing the surface occupied by the grids 402,404, and 406.

Auxiliary Feature of a Main Bingo Game

The following embodiments relate to systems for operating and methods ofplaying auxiliary features of existing bingo games. The features aredesigned to complement existing bingo games in order to improve theprovided entertainments over the course of one or several game session.

The objective of bingo games is traditionally established as a functionof readily identifiable patterns of cells to be daubed within a samegrid, also known as a face, each of which is defined by a predeterminedcount of cells that clearly distinguish themselves from the others bytheir positional relationships. One of the most popular patternsconsists in five horizontally aligned cells. Another one consists infour corner cells. As players grow accustomed to such patterns, theirinterest in the game diminishes; the patterns become repetitive and themonitoring of several grids during a same session becomes effortless.

Disclosed herein is an auxiliary feature of a bingo game. The featureawards a prize upon completion of a predetermined pattern using daubedcells, the pattern extending over more than one of several linked gridsand forming different sub-patterns therein. As a result, differentcontributions are expected from more than one of several linked gridstowards the pattern. Within the context of such a feature, in order toestablish the state of the linked grids, the player must assess theindividual contribution of each of the grids towards the pattern, andsubsequently determine whether the assessed contributions collectivelylead to the desired pattern. As a result, such patterns are not asreadily identifiable as their traditional counterparts.

According to one embodiment, the first player that rightfully claims tohave daubed four, three, and two corner play cells within three linkedgrids is awarded a corresponding prize. Referring to FIG. 5, there isillustrated a display informing players of the pattern to be daubed,where the pattern is described in words 502. The display 500 can beelectronic, such as an LCD screen, and of a sufficient size to bereadily visible by all players seated in a bingo hall. Alternatively,the display 500 can be electronic, but displayed on individual consolesthat are portable or embedded in the play tables of the bingo hall. Thedisplay 500 can also be a board on which the words 502 are written usingchalk or a felt-tip pen.

The predetermined pattern is to be formed using daubed play cells,namely play cells bearing selected ones of a predetermined set ofsymbols such as numbers. Symbols are selected by a means for randomlyselecting different ones of the set of symbols, such as computer programimplementing a random number generator. Alternatively, and referring toFIG. 20, the means of randomly selecting different ones of the set ofsymbols can be a blower 2000, namely a device that produces a current ofair within a chamber until a ball contained therein and assigned to oneof the symbols is ejected through a tube.

The play cells for receiving daubs are organized into grids, which canbe displayed on electronic consoles that are portable or embedded intoplay tables. Alternatively, the grids can be printed on bingo cards.Referring to FIG. 1, there is illustrated a bingo card 100 with threelinked and horizontally aligned grids, namely a grid 102, grid 104, andgrid 106. Furthermore, three corner cells 112 are daubed within the grid102, two corner cells 114 are daubed within the grid 104, and fourcorner cells 116 are daubed within the grid 106.

In order to establish the state of the bingo card 100, the playerdetermines whether at least two corner cells are daubed within the grid102. In this particular case, only one of the four corner cells aredaubed, namely the play cell 112. Since the prize is assigned to thefirst player that rightfully claims to have daubed four, three, and twocorner cells within the grid 102, the grid 104, and the grid 106, andsince only one of the four corner cells has been daubed within the grid102, the player concludes that the objective is yet to be reached withinthe bingo card 100, regardless of the cells daubed within the grid 104and grid 106. If not rushed in time, the player can determine whetherall corner cells of the grid 104 and grid 106 are daubed to establishthe complete state of the card 100 in anticipation of subsequent draws.The player would conclude that two of the four corner cells of the grid104, namely the cells 114, and three corner cells 116 of the grid 106are daubed. Furthermore, the player would conclude that daubing anadditional corner cell of each one of the grids 102, 104, and 106 wouldlead to the objective. Conversely, if rushed in time, the player canforego this process in order to determine whether the objective isreached within other active cards before the subsequent draw.

Within the context of the latter embodiment, the contributions expectedfrom the linked grids involve corner cells exclusively. However,according to other embodiments, the contributions involve a greaternumber of play cells. Such embodiments present distinct challenges withrespect to state monitoring as greater contributions are expected fromthe linked grids.

According to a preferred embodiment, the first player that rightfullyclaims to have daubed cells forming a pattern in the shape of the letter“Y” within a rightmost one of three linked and horizontally alignedgrids, in the shape of the letter “E” within a centermost one of thegrids, and in the shape of the letter “S” within a leftmost one of thegrids, the combination of which spells the word “YES” within the bingocard on which all three grids are printed, is awarded a correspondingprize. Referring to FIG. 6, there is illustrated the display 500informing players of the pattern to be daubed, where the pattern isdescribed using a lines 608 traced within three sample grids 602, 604,and 606.

Referring to FIG. 2, there is illustrated a bingo card 200 with threelinked and horizontally aligned grids, namely a grid 202, grid 204, andgrid 206. Cells daubed within the grid 202 form a pattern in the shapeof the letter “Y”, those within the grid 204 form a pattern in a shapeclosely resembling that of the letter “E”, and those within the grid 206form a pattern in the shape of the letter “S”.

In order to establish the state of the bingo card 200, the playerdetermines whether cells daubed within the grid 202 form a pattern inthe shape of the letter “Y”, and concludes that such a pattern is indeedformed. Subsequently, the player determines whether cells daubed withinthe grid 204 form a pattern in the shape of the letter “E” and concludesthat no such pattern is formed. More specifically, an additional cell,namely a cell 212 bearing the number twenty, needs to be daubed withinthe grid 202 in order for such a pattern to be formed. Since the prizeis awarded upon daubing cells that form a pattern in the shape of theletter “Y” within the grid 202, in the shape of the letter “E” withinthe grid 204, and in the shape of the letter “S” within the grid 206,the player further concludes that the prize is yet to be awarded withinthe card 200. If not rushed in time, the player can determine whethercells daubed within the grid 206 form a pattern in the shape of theletter “S” to establish the complete state of the card 200 inanticipation of subsequent draws. If the player chooses to do so, theplayer concludes that such a pattern is indeed formed within the grid206 and the cell 212 is the only one left in order for the prize to beawarded. Conversely, if rushed in time, the player can forego thisprocess in order to determine whether the predetermined pattern isformed within other active cards before the subsequent draw.

Within the context of the latter embodiment, a different and specificcontribution is expected from each one of three linked grids. However,according to other embodiments, different contributions are expectedfrom some of linked grids, but no contribution is assigned to a specificone of the grids. Such embodiments present distinct challenges withrespect to state monitoring as each one of the contributions can beprovided by any one of the linked grids.

According to a preferred embodiment, the first player that rightfullyclaims to have daubed cells forming a pattern in the shape of the letter“O” within a first of three linked and horizontally aligned grids, andin the shape of the letter “N” within another one of the linked grids,the combination of which spells either one of the words “NO” and “ON”within the bingo card in which the grids are presented, is awarded acorresponding prize. Referring to FIG. 3, there is illustrated a bingocard 300 with three linked and horizontally aligned grids, namely a grid302, a grid 304, and grid 306. All but one peripheral cell of the grid302 are daubed. Furthermore, cells daubed within the grid 306 form apattern in the shape of the letter “N”.

In order to establish the state of the bingo card 300, the playerdetermines whether cells daubed within the grid 302 form a pattern inthe shape of the letter “O” or the letter “N” and concludes that no suchpattern is formed. More specifically, an additional cell bearing thenumber forty-two needs to be daubed in order for a pattern in the shapeof the letter “O” to be formed, and two additional cells, namely theones bearing the numbers twenty-five and fifty-five, need to be daubedin order for a pattern in the shape of the letter “N” to be formedwithin the grid 302. Subsequently, the player determines whether cellsdaubed within the grid 302 form a pattern in the shape of the letter “O”or the letter “N”, and concludes that no such pattern is formed. Sincethe prize is awarded upon daubing cells that form a pattern in the shapeof the letter “O” and another in the shape of the letter “N” within anytwo of the grid 302, grid 304, and grid 306, the player furtherconcludes that the predetermined pattern is yet to be completed withinthe card 300. If not rushed in time, the player can determine whethercells daubed within the grid 306 form a pattern in the shape of theletter “O” or the letter “N” to establish the complete state of the card300 in anticipation of subsequent draws. The player would conclude thatthe cells daubed within the grid 306 form a pattern in the shape of theletter “N” and therefore only the cell bearing the number forty-twoneeds to be daubed in order for the objective to be reached within thecard 300. Conversely, if rushed in time, the player can forego thisprocess in order to determine whether the predetermined pattern iscompleted within other active cards before the subsequent draw.

If the next number to be drawn is indeed forty-two, the player daubs thecorresponding cell, determines whether cells daubed within the grid 302form a pattern in the shape of the letter “O” or the letter “N”, andconcludes that cells daubed within the grid 302 form a pattern in theshape of the letter “O”. Subsequently, the player determines whethercells daubed within the grid 304 form a pattern in the shape of theletter “O” or the letter “N” and concludes that no such pattern isformed. Finally, the player determines whether cells daubed within thegrid 306 form a pattern in the shape of the letter “O” or the letter “N”and concludes that cells daubed within the grid 306 form a pattern inthe shape of the letter “N”. Consequently, the player can rightfullyclaim to have daubed cells forming a pattern in the shape of the letter“O” and another in the shape of the letter “N” within any two of linkedgrids printed on the card 300.

Referring now to FIG. 7, there is shown a flowchart illustrating amethod of operating a system for playing a bingo game having anauxiliary feature, the feature warding a prize when a pattern spanningthree linked grids is daubed. The flowchart is applicable to any of theembodiments described herein above.

In a step 700, three linked grids of play cells are provided to aplayer. The linked grids can be displayed on an electronic console orprinted on a bingo card. While the method is described as provided threelinked grids to the player, it can provide a different number of linkedgrids in accordance with rules of the auxiliary feature. More than oneset of linked grids can be displayed on an electronic console or printedon a bingo card, in which case those of the grids belonging to a sameset are visually distinguished from others. For instance, each set oflinked grids can be of a different colour.

In a step 702, a pattern spanning three linked grids is displayed. Apattern is said to span several grids if it extends over several grids.The pattern is displayed on a means for displaying such as an electronicconsole, an electronic display, or a board on which the bingo operatorcan draw. Such a display informs the players of the pattern to be formedusing daubed cells belonging to a same set of linked grids.

In a step 704, one of a predetermined set of numbers is randomlyselected. The number can be automatically selected by a computer programimplementing a random number generator or by an operator activating ablower. In embodiments where at least one play cell can bear one of apredetermined set of non-numerical symbols, one of the non-numericalsymbols can alternatively be selected in the step 704.

In a step 706, the linked grids are verified to determine whether any ofthe play cells bear the number selected in the step 704. In embodimentswhere the grids are printed on a bingo card, the verification can beperformed by the player. However, in embodiments where the grids aredisplayed on electronic consoles, a computer program running on theconsole, or on a server managed by the bingo operator and communicatingwith the console, and communicating with the means for selecting canautomatically search the play cells for the selected number.

If in the step 706, at least one of the play cells is identified asbearing the selected number, and in a step 708, the identified play cellis daubed. In embodiments where the grids are printed on bingo cards,the player can daub the identified cell by applying a dauber over thesurface of the bingo card on which the identified cell is printed. Thedauber leaves an ink mark on the bingo card distinguishing theidentified play cell from those bearing a yet to be selected one of theset of numbers. However, in embodiments where the grids are displayed onelectronic consoles, a computer program running on the console, or on aserver managed by the bingo operator and communicating with the console,can assign a visual indicator automatically or in response to play inputto the identified cell for it to be distinguished from those of thecells bearing a yet to be selecting one of the set of numbers.

In a step 710, it is verified whether a predetermined pattern is formedby the daubed play cells belonging of the linked grids. In embodimentswhere the grids are printed on a bingo card, the verification can beperformed by the player. However, in embodiments where the grids aredisplayed on electronic consoles, a computer program running on theconsole, or on a server managed by the bingo operator and communicatingwith the console, can automatically search the play cells for thepredetermined pattern.

If according to the verification performed in the step 710, the daubedplay cells of the linked grids form the predetermined pattern, theplayer holding the linked grids is awarded a payout in a step 712. Thepayout can be of monetary or non-monetary nature. The prize can beawarded manually, by a representative of the bingo operator, orelectronically, by a computer program having access to player accountsand triggered upon completion of the pattern.

Once the payout is awarded, the auxiliary feature ends in a step 714 andall grids become invalid for that particular feature. Alternatively,only the linked grids in which the predetermined pattern was formedbecome invalid and the other grids remain valid for a same or differentauxiliary feature. According to yet another embodiment, all grids remainvalid for a different auxiliary feature.

However, if according to the verification performed in the step 710, thedaubed play cells of the linked grids have yet to form the predeterminedpattern, a count of number selections is incremented by one in a step716. The count is updated in order to ensure that the predeterminedpattern is formed within a maximum established in accordance with rulesof the auxiliary feature.

However, according to another embodiment, the rules of the auxiliaryfeature do not establish such a restriction and no count of numberselections is recorded.

In a step 718, it is verified whether the count of number selections hasreached the predetermined maximum. The verification can be performed bya representative of the bingo operator or by a computer programcommunicating with the selection means. If the maximum is reached, theauxiliary feature ends in the step 714. Otherwise, the auxiliary featureremains valid for the subsequent number selection performed in the step704.

Disclosed herein is an auxiliary feature that awards a prize uponsatisfaction of arithmetic relationships by counts of daubed cellsbelonging to each of several linked grids. The auxiliary featurepresents distinct challenges with respect to state monitoring as thecontribution of any one of the linked grids can not be assessedindependently from those of its brethren.

According to a preferred embodiment, the first player that rightfullyclaims to have a triple-faced bingo card wherein one of the grids hasprecisely four daubed cells more than the least daubed grid, and anotherone of the grids has precisely eight daubed cells more than the leastdaubed grid, is awarded a corresponding prize. Referring to FIG. 9,there is illustrated a display 500 informing players of an arithmeticfunction to be satisfied, where the function is described in words 902.Alternatively, and referring to FIG. 10, an arithmetic function can bedescribed using a combination of arithmetic expressions 1008 and threesample grids 1002, 1004, and 1006.

Referring to FIG. 8, there is illustrated a bingo card 800 with threelinked and horizontally aligned grids, namely a grid 802, grid 804, andgrid 806. Two play cells are daubed within the grid 802, six are daubedwithin the grid 804, and nine are daubed within the grid 806.

In order to establish the state of the bingo card 800, the playerdetermines the count of cells daubed within each of the grid 802, grid804, and grid 806.

Unlike a readily identifiable pattern, such a number cannot beascertained from a quick glance at the card 800. Therefore, the playereither counts or updates a memorized count of the count of cells daubedwithin each of the grid 802, the grid 804, and the grid 806, comparesthe resulting counts to determine whether the desired arithmeticfunction is satisfied, and concludes that the objective is yet to bereached within the card 800. Indeed, while the grid 804 has four daubedcells more than the grid 802, the grid 806 has only seven daubed cellsmore than the grid 802, and therefore, one additional cell needs to bedaubed within the grid 806 before the player can rightfully claim tohave three linked grids satisfying the desired arithmetic function.

If the next number to be drawn is borne by a cell within the grid 806,and not borne by any of the cells within the grid 802 and grid 804, theplayer daubs the corresponding cell, either counts or updates amemorized count of the count of cells daubed within the grid 802, grid804, and grid 806, compares the resulting counts to determine whetherthe desired arithmetic function is satisfied, and concludes that thearithmetic function is yet to be reached within the card 800. Indeed,while the grid 804 has four daubed cells more than the grid 802, thegrid 806 has eight daubed cells more than the grid 802.

If however, the next number to be drawn is not exclusively borne by acell within the grid 806, the player daubs the corresponding cells, ifany, either counts or updates a memorized count of daubed cellsbelonging to the grid 802 and grid 804, compares the resulting counts todetermine whether the desired arithmetic function is satisfied, andconcludes that the arithmetic function is yet to be satisfied within thecard 800, regardless of the count of cells daubed within the grid 806.If not rushed in time, the player can determine the count of cellsdaubed within the grid 806 to assess the complete state of the card 800in anticipation of subsequent draws. Conversely, if rushed in time, theplayer can forego this process in order to determine whether theobjective is reached within other active cards before the subsequentdraw.

It is important to note that within the context of traditional bingogames, a grid either stagnates or progresses towards an objective overthe course of a session, whereas in the context of this particularauxiliary feature, a single daub can pull a card away from the prize.For instance, in the case illustrated in FIG. 8, while an additionaldaub within the grid 806 is sufficient for the arithmetic function to besatisfied, an additional daub within the grid 804 is sufficient to pullthe card 800 away from satisfaction of the arithmetic function. Indeed,in the latter case, three additional daubs would subsequently berequired, namely one within the grid 802 and two within the grid 806.The auxiliary feature provides for greater entertainment as players canexperience several ephemeral near wins within a same card.

Referring now to FIG. 11, there is shown a flowchart illustrating amethod of operating a system for playing a bingo game having anauxiliary feature, the feature awarding a prize when a predeterminedarithmetic function is satisfied by grid counts corresponding to threelinked grids.

In a step 1100, three linked grids of play cells are provided to aplayer. The linked grids can be displayed on an electronic console orprinted on a bingo card. While the method is described as providingthree linked grids to the player, it can provide a different number oflinked grids in accordance with rules of the auxiliary feature. Morethan one set of linked grids can be displayed on an electronic consoleor printed on a bingo card, in which case those of the grids belongingto a same set are visually distinguished from others. For instance, eachset of linked grids can be of a different colour.

In a step 1102, an arithmetic function to be satisfied by a count of thedaubed play cells belonging to a first of three linked grids, a count ofthe daubed play cells belonging to a second of the linked grids, and acount of the daubed play cells belonging to a third of the linked gridsis displayed. The function is displayed on a means for displaying suchas an electronic console, an electronic display, or a board on which thebingo operator can draw using chalk or a felt-tip pen. Such a displayinforms the players of the arithmetic function to be satisfied.

In a step 1104, one of a predetermined set of numbers is randomlyselected. The number can be automatically selected by a computer programimplementing a random number generator or by an operator activating ablower. In embodiments where at least one play cell can bear one of apredetermined set of non-numerical symbols, one of the non-numericalsymbols can alternatively be selected in the step 1104.

In a step 1106, the linked grids are verified to determine whether anyof the play cells bear the number selected in the step 1104. Inembodiments where the grids are printed on a bingo card, theverification can be performed by the player. However, in embodimentswhere the grids are displayed on electronic consoles, a computer programrunning on the console, or on a server managed by the bingo operator andcommunicating with the console, and communicating with the means forselecting can automatically search the play cells for the selectednumber.

If in the step 1106, at least one of the play cells is identified asbearing the selected number, and in a step 1108, the identified playcell is daubed. In embodiments where the grids are printed on bingocards, the player can daub the identified cell by applying a dauber overthe surface of the bingo card on which the identified cell is printed.The dauber leaves an ink mark on the bingo card distinguishing theidentified play cell from those bearing a yet to be selected one of theset of numbers. However, in embodiments where the grids are displayed onelectronic consoles, a computer program running on the console, or on aserver managed by the bingo operator and communicating with the console,can assign a visual indicator automatically or in response to play inputto the identified cell for it to be distinguished from those of thecells bearing a yet to be selecting one of the set of numbers.

In a step 1110, for each play cell daubed in the step 1108, acorresponding grid count is incremented. A grid count represents a totalcount of daubed play cells belonging to one of the linked grids. Inembodiments where the grids are printed on a bingo card, the grid countscan be calculated by the player. However, in embodiments where the gridsare displayed on electronic consoles, a computer program running on theconsole, or on a server managed by the bingo operator and communicatingwith the console, can automatically increment the grid counts.

In a step 1112, it is verified whether the three grid countscorresponding to the set of linked grids satisfy the arithmeticfunction. In embodiments where the grids are printed on a bingo card,the verification can be performed by the player. However, in embodimentswhere the grids are displayed on electronic consoles, a computer programrunning on the console, or on a server managed by the bingo operator andcommunicating with the console, can automatically compare the gridcounts according to the predetermined arithmetic function.

If according to the verification performed in the step 1112, the gridcounts of the linked grids satisfy the predetermined arithmeticfunction, the player holding the linked grids is awarded a payout in astep 1114. The payout can be of monetary or non-monetary nature. Theprize can be awarded manually, by a representative of the bingooperator, or electronically, by a computer program having access toplayer accounts and triggered upon satisfaction of the predeterminedarithmetic function.

Once the payout is awarded, the auxiliary feature ends in a step 1116and all grids become invalid with respect to the auxiliary feature.Alternatively, only the linked grids whose grid counts satisfy thepredetermined arithmetic function become invalid and the other gridsremain valid for a same or different auxiliary feature. According to yetanother embodiment, all grids remain valid for a different auxiliaryfeature.

However, if according to the verification performed in the step 1112,the grid counts of the linked grids have yet to satisfy thepredetermined arithmetic function, a count of number selections isincremented by one in a step 1118. The count is updated in order toensure that the predetermined arithmetic function is satisfied within amaximum established in accordance with rules of the auxiliary feature.However, according to another embodiment, the rules of the auxiliaryfeature do not establish such a restriction and no count of numberselections is recorded.

In a step 1120, it is verified whether the count of number selectionshas reached the predetermined maximum. The verification can be performedby a representative of the bingo operator or by a computer programcommunicating with the selection means. If the maximum is reached, theauxiliary feature ends in the step 1116. Otherwise, the auxiliaryfeature remains valid for the subsequent number selection performed inthe step 1104.

Disclosed herein is another novel auxiliary feature of an existing bingogame. The feature awards a prize upon satisfaction of an arithmeticrelationship by a count of the daubed cells belonging to a grid and alast number daubed within the same grid. Within the context of such anauxiliary feature, in order to establish the state of a grid, the playereither counts or keeps a count of daubed cells within the grid, andcompares the resulting number with the number borne by the last celldaubed within the same grid. Both alternatives are challenging withinthe context of simultaneously active grids, but for different reasons.The first tries the speed at with which is counted the number of daubedcells within each active grid, and the second, the ability to memorizean evolving count for each active grid.

According to a preferred embodiment, the first player that rightfullyclaims to have daubed a count of cells equal to the number borne by thelast daubed cell over the course of a same session is awarded acorresponding prize. Referring to FIG. 13, there is illustrated thedisplay 500 informing players of an arithmetic function to be satisfied,where the function is described in words 1302. Alternatively, andreferring to FIG. 14, an arithmetic function can be described using acombination of a representation of a bingo ball 1404, a sample grid1402, a close-up on a play cell of interest 1406, and a grid count 1408.

Referring now to FIG. 12, there is illustrated a bingo card 1200 havinga single grid 1202, in which five out of twenty-five cells 1204 aredaubed. Furthermore, a yet to be daubed cell 1206 bears the number six.

In order to establish the state of the grid 1202, the player counts thecells 1204 daubed. Unlike a readily identifiable pattern, such a numbercannot be accurately ascertained from a quick glance at the grid 1202.Therefore, the player either counts or updates a memorized count ofdaubed ones of the cells 1204. Subsequently, the player compares theresulting count, namely five, with the number borne by the last cell tobe daubed, namely twenty-eight, to conclude that the objective is yet tobe reached within the grid 1202.

If the next number to be drawn is six, the player daubs thecorresponding cell 1206, either counts or increments a memorized countof the cells 1204 daubed, and compares the count, namely six, with thenumber borne by the last daubed cell 1206, namely six, to conclude thatthe objective is reached within the grid 1202.

However, if the next number to be drawn is borne by one of the cells1204 other than the cell 1206, the player daubs the corresponding one ofthe cells 1204 and counts or increments a memorized count of the cells1204 daubed. Since the resulting count is greater than six, the cell1206 can no longer be the sixth cell to be daubed within the grid 1202,and consequently, the objective for this particular grid shifts to thesmallest number greater than six and borne by a yet to be daubed cell.For instance, in the particular case illustrated in FIG. 12, if thenumber three is drawn, satisfaction of the arithmetic function shifts tothe number ten. If rushed in time, and knowing that the objective hasnot been reached within the grid 1202, the player can forego thisprocess in order to determine whether the objective is reached withinother active grids before the subsequent draw.

Alternatively, if the next number to be drawn is not borne by any of thecells 1204, the player does not daub any of the cells 1204. Since thecount of cells 1204 daubed within the grid 1202 remains unchanged andsmaller than six, the cell 1206 can still turn out be the sixth cell tobe daubed within the grid 1202, and consequently, satisfaction of thearithmetic function for this particular grid remains hinged on thenumber six. Consequently, the player would only count the cells 1204daubed to identify the number upon which satisfaction of the arithmeticfunction hinges in anticipation of subsequently drawn numbers. If rushedin time, and knowing that the arithmetic function has not been satisfiedwithin the grid 1202, the player can forego this process in order todetermine whether the arithmetic function is satisfied within otheractive grids before the subsequent draw.

While the auxiliary feature has been described as involving anindividual grid, it can very well involve several linked grids, whereinthe arithmetic function is to be satisfied by a total count of daubedplay cells belonging to the grids and a number borne by the last celldaubed within the linked grids. In this particular embodiment, theplayer encounters greater difficulty in establishing the state of thegrids as satisfaction of the arithmetic function requires contributionfrom more than one grid.

Referring now to FIG. 15, there is shown a flowchart illustrating amethod of operating a system for playing a bingo game having anauxiliary feature, the auxiliary feature awarding a prize when anarithmetic function is satisfied by a grid count and a number borne by alast daubed cell.

In a step 1500, a grid of play cells is provided to a player. The gridcan be displayed on an electronic console or printed on a bingo card.While the method is described as providing a grid to the player, it canprovide a greater number of grids in accordance with rules of theauxiliary feature. More than one grid can be displayed on an electronicconsole or printed on a bingo card.

In a step 1502, an arithmetic function to be satisfied by a grid countand a number borne by a last daubed cell is displayed. The function isdisplayed on a means for displaying such as an electronic console, anelectronic display, or a board on which the bingo operator can drawusing chalk or a felt-tip pen. Such a display informs the players of thearithmetic function to be satisfied.

In a step 1504, one of a predetermined set of numbers is randomlyselected. The number can be automatically selected by a computer programimplementing a random number generator or by an operator activating ablower. In embodiments where at least one play cell can bear one of apredetermined set of non-numerical symbols, one of the non-numericalsymbols can alternatively be selected in the step 1504.

In a step 1506, the grid is verified to determine whether any of theplay cells bear the number selected in the step 1504. In embodimentswhere the grid is printed on a bingo card, the verification can beperformed by the player. However, in embodiments where the grid isdisplayed on electronic consoles, a computer program running on theconsole, or on a server managed by the bingo operator and communicatingwith the console, and communicating with the means for selecting canautomatically search the play cells for the selected number.

If in the step 1506, at least one of the play cells is identified asbearing the selected number, and in a step 1508, the identified playcell is daubed. In embodiments where the grid is printed on a bingocard, the player can daub the identified cell by applying a dauber overthe surface of the bingo card on which the identified cell is printed.The dauber leaves an ink mark on the bingo card distinguishing theidentified play cell from those bearing a yet to be selected one of theset of numbers. However, in embodiments where the grid is displayed onelectronic consoles, a computer program running on the console, or on aserver managed by the bingo operator and communicating with the console,can assign a visual indicator automatically or in response to play inputto the identified cell for it to be distinguished from those of thecells bearing a yet to be selecting one of the set of numbers.

In a step 1510, for each play cell daubed in the step 1508, acorresponding grid count is incremented. A grid count represents a totalcount of daubed play cells belonging to the grid. In embodiments wherethe grid is printed on a bingo card, the grid count can be calculated bythe player. However, in embodiments where the grid is displayed onelectronic consoles, a computer program running on the console, or on aserver managed by the bingo operator and communicating with the console,can automatically increment the grid count.

In a step 1512, it is verified whether the grid count and the numberselected in the step 1504 satisfy the predetermined arithmetic function.In embodiments where the grid is printed on a bingo card, theverification can be performed by the player. However, in embodimentswhere the grid is displayed on electronic consoles, a computer programrunning on the console, or on a server managed by the bingo operator andcommunicating with the console, can automatically compare the grid countand the number selected in the step 1504 according to the predeterminedarithmetic function.

If according to the verification performed in the step 1512, the gridcount and the number selected in the step 1504 satisfy the predeterminedarithmetic function, the player holding the grid is awarded a payout ina step 1514. The payout can be of monetary or non-monetary nature. Theprize can be awarded manually, by a representative of the bingooperator, or electronically, by a computer program having access toplayer accounts and triggered upon satisfaction of the predeterminedarithmetic function.

Once the payout is awarded, the auxiliary feature ends in a step 1516and all grids become invalid with respect to the auxiliary feature.Alternatively, only the grid whose grid count satisfies thepredetermined arithmetic function with the number selected in the step1504 becomes invalid and the other grids remain valid for a same ordifferent auxiliary feature. According to yet another embodiment, allgrids remain valid for a different auxiliary feature.

However, if according to the verification performed in the step 1512,the grid count has yet to satisfy the predetermined arithmetic functionalong with the number selected in the step 1504, a count of numberselections is incremented by one in a step 1518. The count is updated inorder to ensure that the predetermined arithmetic function is satisfiedwithin a maximum established in accordance with rules of the auxiliaryfeature. However, according to another embodiment, the rules of theauxiliary feature do not establish such a restriction and no count ofnumber selections is recorded.

In a step 1520, it is verified whether the count of number selectionshas reached the predetermined maximum. The verification can be performedby a representative of the bingo operator or by a computer programcommunicating with the selection means. If the maximum is reached, theauxiliary feature ends in the step 1516. Otherwise, the auxiliaryfeature resumes with the selection of a new number in the step 1504.

At least some novice and experienced players look to increase the oddsof winning a prize by purchasing a greater number of grids. There istherefore a need for a system that allows novice and experienced playersto monitor the state of a greater number of simultaneously active grids,particularly within the context of games such as those described hereinabove, wherein states are not readily identifiable within cards.

Disclosed herein is a system for recording and displaying values of oneor more parameters defining the state of a grid or several linked grids.Herein below, the system is described within the context of a bingogame, the objective of which is defined as a function of a number ofdaubed cells bearing a same attribute designation, but can very well beapplied within the context of other games.

Referring now to FIG. 4, there is illustrated a bingo card 400 withthree linked grids, namely a grid 402, grid 404, and grid 406. Somecells are endowed with a hare attribute designation 410 and others areendowed with a tortoise attribute designation 408. At the bottom of thecard 400, beneath the grids 402, 404, and 406, are printed a grid 412comprised of ten cells and associated to the hare attribute designation410, as well as a grid 414 comprised of ten cells and associated to thetortoise attribute designation 408.

The attribute designations 408 and 410 are displayed within the grids402, 404, and 406 for the purposes of a particular bingo game, theobjective of which consists in being the first to have daubed ten cellsbearing a same one of the attribute designation 408 and attributedesignation 410 within a same series of linked grids. Within the contextof such a game, the parameter values defining the states of the grids402, 404, and 406 consist in the count of daubed cells bearing theattribute designation 408, and the count of daubed cells bearing theattribute designation 410.

In order to establish the state of the bingo card 400, the playerdetermines the number of daubed cells bearing a same one of theattribute designations 408 and 410 within the grids 402, 404, and 406.Unlike a readily identifiable pattern, such a number cannot beascertained from a quick glance at the card 400, at least partiallybecause there are two types of symbols, namely the attributedesignations 408 and 410, and because the symbols are randomly scatteredacross the grids 402, 404, and 406. Therefore, the player either countsor updates memorized counts of daubed cells bearing a same one of theattribute designations 408 and 410 within the grids 402, 404, and 406,and determines whether any of the resulting counts have reached thenumber ten.

Alternatively, the player can monitor the state of the bingo card 400 bydaubing a cell within a corresponding one of the grids 412 and 414 foreach cell daubed within one of the grids 402, 404, and 406 bearing oneof the attribute designations 408 and 410. For instance, if the numberten is drawn, the player daubs the cell within the grid 402 bearing thenumber ten and a first cell within the grid 412. Subsequently, theplayer daubs the cell within the grid 406 bearing the number ten and asecond cell within the grid 412.

Not only is the action of daubing cells within the grids 412 and 414entertaining, but it also enables players to readily monitor within thegrids 412 and 414 the number of daubed cells bearing a same one of theattribute designations 408 and 410, as well as the count of cellsbearing a same one of the attribute designations 408 and 410 to bedaubed in order for the desired objectives to be reached within the card400. As a result, in cases where few cells need to be daubed in orderfor the objective to be reached, the corresponding near win situation isbrought to the attention of the player within the grids 412 and 414,thereby increasing interest in subsequent draws in anticipation of aneventual win.

According to one embodiment, the count of cells bearing the attributedesignation 408 equals the count of cells of the grid 412, and the countof cells bearing the number 410 equals the count of cells of the grid414. The objective of the game is defined as a function of apredetermined number of daubed cells within a first predetermined subsetof cells, namely those to which the attribute designation 408 isassigned, and as a function of a predetermined number of daubed cellswithin a second predetermined subset of cells, namely those to which theattribute designation 410 is assigned.

According to another embodiment, the count of cells bearing theattribute designation 408 is greater than the count of cells of the grid412, and the count of cells bearing the attribute designation 410 isgreater than the count of cells of the grid 414. The objective of thegame is defined as a function of two predetermined patterns extendingover more than one of several linked grids, the first predeterminedpattern consisting in cells to which the attribute designation 408 isassigned, and the second predetermined pattern consisting in cells towhich the attribute designation 410 is assigned.

According to one embodiment, an equal count of cells bear a same one ofthe attribute designations 408 and 410. However, according to anotherembodiment, the count of cells bearing a first one of the attributedesignations 408 and 410 is greater than the count of cells bearing thesecond one of the attribute designations 408 and 410.

According to one embodiment, the grid 412 and the grid 414 include anequal count of cells. However, according to another embodiment, a firstone of the grid 412 and the grid 414 includes a greater count of cellsthan the second one of the grid 414.

The cells of the grids 412 and 414 have been described as trackingcells, namely ones that provide an indication as to a count of daubedcells endowed with a corresponding one of the symbols 408 and 410.However, according to another embodiment, the cells of the grids 412 and414 can be used as conversion cells, namely ones that reflect the valueof each one of the attribute designations 408 and 410 with respect to anobjective of the game.

According to the embodiments where the cells of the grids 412 and 414are used as conversion cells instead of tracking cells, the player daubsa first predetermined count of different ones of the cells of the grid412 for each daubed play cell endowed with the attribute designation 408according to the rules of an auxiliary feature. Similarly, the playerdaubs a second predetermined count of different ones of the cells of thegrid 414 for each daubed play cell endowed with the attributedesignation 410 according to the rules of the auxiliary feature. A firstprize is awarded when each one of the cells of the grid 412 is daubed. Asecond prize is awarded when each one of the cells of the grid 414 isdaubed. The first and second predetermined counts are established inaccordance with rules of the auxiliary feature, and can be equal orunequal. The first and second prizes are established in accordance withrules of the auxiliary feature and can be equal or unequal. Forinstance, the first predetermined count can be greater than the secondpredetermined count, and the second prize can be greater than the firstprize.

While the auxiliary features have been described as involving two typesof attribute designations, namely the attribute designations 408 and410, it can very well involve a single attribute designation or morethan two attribute designations. Also, while a single attributedesignation, namely the attribute designation 408, is assigned to allcells of the grid 412, and a single attribute designation, namely theattribute designation 410, is assigned to all cells of the grid 414,more than one attribute designation can be assigned to a single cell.

While a same attribute designation, namely the attribute designation408, is assigned to all cells of the grid 412, and a single attributedesignation, namely the attribute designation 410, is assigned to allcells of the grid 414, a different attribute designation can be assignedto at least some of the cells of a same grid. According to oneembodiment, a different attribute designation is assigned to at leastsome of the cells of a same grid, and when the player daubs a grid cellbearing an attribute designation, the player can daub no more than onegrid cell, or no more than a predetermined count of cells to which theattribute designation is assigned. According to one embodiment, adifferent attribute designation is assigned to at least some of thecells of a same grid, and when the player daubs a grid cell bearing anattribute designation, the player can daub all grid cells to which theattribute designation is assigned.

According to one embodiment, a word is selected by the bingo operator,each letter of the word is assigned to a cell of the grid 412 such thatthe cells of the grid 412 spell the word, and each letter of thealphabet included in the word corresponds to a type of attributedesignation borne by cells of the grids 402, 404, and 406. For instance,if the selected word is CHOCOLATE, the grid 412 would include ninecells, one for each letter of the word, and the cells of the grids 402,404, and 406 would involve seven types of attribute designations, onefor each letter of the alphabet included in CHOCOLATE. According to oneembodiment, when the player daubs a cell of any one of the grids 402,404, and 406 bearing the letter C or O, the player can daub only one ofthe two cells of the grid 412 to which the letter was assigned. However,according to another embodiment, the player can daub both cells of thegrid 412 to which the letter is assigned.

The cells of the grids 412 and 414 have been described as trackingcells, namely ones that provide an indication as to a count of daubedcells endowed with a corresponding one of the attribute designations 408and 410. However, according to another embodiment, the cells of thegrids 412 and 414 can be used as conversion cells, namely ones thatreflect the value of each one of the attribute designations 408 and 410with respect to an auxiliary feature.

According to the embodiments where cells of the grids 412 and 414 areused as conversion cells instead of tracking cells, the player daubs afirst predetermined count of different ones of the cells of the grid 412for each daubed play cell endowed with the attribute designation 408according to the rules of an auxiliary feature. Similarly, the playerdaubs a second predetermined count of different ones of the cells of thegrid 414 for each daubed play cell endowed with the attributedesignation 410 according to the rules of the auxiliary feature. A firstprize is awarded when each cell of the grid 412 is daubed. A secondprize is awarded when each cell of the grid 414 is daubed. The first andsecond predetermined counts are established in accordance with rules ofthe auxiliary feature, and can be equal or unequal. The first and secondprizes are established in accordance with rules of the auxiliary featureand can be equal or unequal. For instance, the first predetermined countcan be greater than the second predetermined count, and the second prizecan be greater than the first prize.

Referring now to FIG. 17, there is shown a flowchart illustrating amethod of playing an a bingo game on a bingo card having one M×N grid ofplay cells and another grid of tracking cells, each one of M and N beinggreater than two. A prize is awarded to a player holding the grid wheneach one of the tracking cells is daubed.

In a step 1700, the grids of play cells and tracking cells are providedto a player. The grids can be displayed on an electronic console orprinted on a bingo card. While the method is described as providing onegrid of play cells to the player, it can provide a greater number ofgrids of play cells in accordance with rules of the game. Similarly,while the method is described as providing one grid of tracking cells tothe player, it can provide a greater number of grids of tracking cellsin accordance with rules of the game. More than one grid of play cellscan be displayed on an electronic console or printed on a bingo card.Similarly, more than one grid of play cells can be displayed on anelectronic console or printed on a bingo card.

In a step 1702, a pattern spanning three linked grids is displayed. Apattern is said to span several grids if it extends over several grids.The pattern is displayed on a means for displaying such as an electronicconsole, an electronic display, or a board on which the bingo operatorcan draw. Such a display informs the players of the pattern to be formedusing daubed cells belonging to a same set of linked grids.

In a step 1704, one of a predetermined set of numbers is randomlyselected. The number can be automatically selected by a computer programimplementing a random number generator or by an operator activating ablower. In embodiments where at least one play cell can bear one of apredetermined set of non-numerical symbols, one of the non-numericalsymbols can alternatively be selected in the step 1704.

In a step 1706, the grid is verified to determine whether any of theplay cells bear the number selected in the step 1704. In embodimentswhere the grid is printed on a bingo card, the verification can beperformed by the player. However, in embodiments where the grid isdisplayed on electronic consoles, a computer program running on theconsole, or on a server managed by the bingo operator and communicatingwith the console, and communicating with the means for selecting canautomatically search the play cells for the selected number.

If in the step 1706, at least one of the play cells is identified asbearing the selected number, and in a step 1708, the identified playcell is daubed. In embodiments where the grid is printed on a bingocard, the player can daub the identified cell by applying a dauber overthe surface of the bingo card on which the identified cell is printed.The dauber leaves an ink mark on the bingo card distinguishing theidentified play cell from those bearing a yet to be selected one of theset of numbers. However, in embodiments where the grid is displayed onelectronic consoles, a computer program running on the console, or on aserver managed by the bingo operator and communicating with the console,can assign a visual indicator automatically or in response to play inputto the identified cell for it to be distinguished from those of thecells bearing a yet to be selecting one of the set of numbers.

In a step 1710, for each play cell daubed in the step 1708, it isdetermined whether the play cell daubed in the step 1708 is endowed withan attribute designation. In embodiments where the grid is printed on abingo card, the verification can be performed by the player. However, inembodiments where the grid is displayed on electronic consoles, acomputer program running on the console, or on a server managed by thebingo operator and communicating with the console, can automaticallyperform the verification.

If in the step 1710, the play cell is identified as bearing theattribute designation, and in a step 1712, one of the tracking cells isdaubed. In embodiments where the grid is printed on a bingo card, theplayer can daub a tracking cell by applying a dauber over the surface ofthe bingo card on which an available one of the tracking cells isprinted. The dauber leaves an ink mark on the bingo card distinguishingthe tracking cell from those that have yet to be daubed. However, inembodiments where the grid is displayed on electronic consoles, acomputer program running on the console, or on a server managed by thebingo operator and communicating with the console, can assign a visualindicator automatically or in response to play input to an availabletracking cell for it to be distinguished from those of the trackingcells that remain available.

In a step 1714, it is verified whether each one of the tracking cellshas been daubed. In embodiments where the grids are printed on a bingocard, the verification can be performed by the player. However, inembodiments where the grids are displayed on electronic consoles, acomputer program running on the console, or on a server managed by thebingo operator and communicating with the console, can automaticallysearch for an available tracking cell.

If according to the verification performed in the step 1714, each one ofthe tracking cells has been daubed, the player holding the grid isawarded a payout in a step 1716. The payout can be of monetary ornon-monetary nature. The prize can be awarded manually, by arepresentative of the bingo operator, or electronically, by a computerprogram having access to player accounts and triggered once the last oneof the available tracking cells has been daubed.

Once the payout is awarded, the game ends in a step 1718 and all gridsof play cells become invalid. Alternatively, only the grid of play cellsfor which all tracking cells have been daubed becomes invalid, and theother grids remain valid for a subsequent game having a same ordifferent objective. According to yet another embodiment, all gridsremain valid for a subsequent game having a different objective.

However, if according to the verification performed in the step 1714, atleast one of the tracking cells remains available, a count of numberselections is incremented by one in a step 1720. The count is updated inorder to ensure that the predetermined arithmetic function is satisfiedwithin a maximum established in accordance with rules of the game.However, according to another embodiment, the rules of the game do notestablish such a restriction and no count of number selections isrecorded.

In a step 1722, it is verified whether the count of number selectionshas reached the predetermined maximum. The verification can be performedby a representative of the bingo operator or by a computer programcommunicating with the selection means. If the maximum is reached, thegame ends in the step 1718. Otherwise, the game resumes with theselection of a new number in the step 1704.

Referring now to FIG. 16, there is shown a flowchart illustrating amethod of playing an auxiliary feature of a bingo game on a bingo cardhaving one M×N grid of play cells and another grid of conversion cells,each one of M and N being greater than two. A prize is awarded to aplayer holding the grid when each one of the conversion cells is daubed.

In a step 1600, the grids of play cells and conversion cells areprovided to a player. The grids can be displayed on an electronicconsole or printed on a bingo card. While the method is described asproviding one grid of play cells to the player, it can provide a greaternumber of grids of play cells in accordance with rules of the auxiliaryfeature. Similarly, while the method is described as providing one gridof conversion cells to the player, it can provide a greater number ofgrids of conversion cells in accordance with rules of the auxiliaryfeature. More than one grid of play cells can be displayed on anelectronic console or printed on a bingo card. Similarly, more than onegrid of play cells can be displayed on an electronic console or printedon a bingo card.

In a step 1602, a pattern spanning three linked grids is displayed. Apattern is said to span several grids if it extends over several grids.The pattern is displayed on a means for displaying such as an electronicconsole, an electronic display, or a board on which the bingo operatorcan draw. Such a display informs the players of the pattern to be formedusing daubed cells belonging to a same set of linked grids.

In a step 1604, one of a predetermined set of numbers is randomlyselected. The number can be automatically selected by a computer programimplementing a random number generator or by an operator activating ablower. In embodiments where at least one play cell can bear one of apredetermined set of non-numerical symbols, one of the non-numericalsymbols can alternatively be selected in the step 1604.

In a step 1606, the grid is verified to determine whether any of theplay cells bear the number selected in the step 1604. In embodimentswhere the grid is printed on a bingo card, the verification can beperformed by the player. However, in embodiments where the grid isdisplayed on electronic consoles, a computer program running on theconsole, or on a server managed by the bingo operator and communicatingwith the console, and communicating with the means for selecting canautomatically search the play cells for the selected number.

If in the step 1606, at least one of the play cells is identified asbearing the selected number, and in a step 1608, the identified playcell is daubed. In embodiments where the grid is printed on a bingocard, the player can daub the identified cell by applying a dauber overthe surface of the bingo card on which the identified cell is printed.The dauber leaves an ink mark on the bingo card distinguishing theidentified play cell from those bearing a yet to be selected one of theset of numbers. However, in embodiments where the grid is displayed onelectronic consoles, a computer program running on the console, or on aserver managed by the bingo operator and communicating with the console,can assign a visual indicator automatically or in response to play inputto the identified cell for it to be distinguished from those of thecells bearing a yet to be selecting one of the set of numbers.

In a step 1610, for each play cell daubed in the step 1608, it isdetermined whether the play cell daubed in the step 1608 is endowed withan attribute designation. In embodiments where the grid is printed on abingo card, the verification can be performed by the player. However, inembodiments where the grid is displayed on electronic consoles, acomputer program running on the console, or on a server managed by thebingo operator and communicating with the console, can automaticallyperform the verification.

If in the step 1610, the play cell is identified as bearing theattribute designation, and in a step 1612, a predetermined count of theconversion cells is daubed. In embodiments where the grid is printed ona bingo card, the player can daub conversion cells by applying a dauberover the surface of the bingo card on which available ones of theconversion cells is printed. The dauber leaves an ink mark on the bingocard distinguishing the conversion cells from those that have yet to bedaubed. However, in embodiments where the grid is displayed onelectronic consoles, a computer program running on the console, or on aserver managed by the bingo operator and communicating with the console,can assign a visual indicator automatically or in response to play inputto available conversion cells for them to be distinguished from those ofthe conversion cells that remain available.

In a step 1614, it is verified whether each one of the conversion cellshas been daubed. In embodiments where the grids are printed on a bingocard, the verification can be performed by the player. However, inembodiments where the grids are displayed on electronic consoles, acomputer program running on the console, or on a server managed by thebingo operator and communicating with the console, can automaticallysearch for an available conversion cell.

If according to the verification performed in the step 1614, each one ofthe conversion cells has been daubed, the player holding the grid isawarded a payout in a step 1616. The payout can be of monetary ornon-monetary nature. The prize can be awarded manually, by arepresentative of the bingo operator, or electronically, by a computerprogram having access to player accounts and triggered once the last oneof the available conversion cells has been daubed.

Once the payout is awarded, the auxiliary feature ends in a step 1618and all grids of play cells become invalid with respect to the auxiliaryfeature. Alternatively, only the grid of play cells for which allconversion cells have been daubed becomes invalid, and the other gridsremain valid for a same or different auxiliary feature. According to yetanother embodiment, all grids remain valid for a different auxiliaryfeature.

However, if according to the verification performed in the step 1614, atleast one of the conversion cells remains available, a count of numberselections is incremented by one in a step 1620. The count is updated inorder to ensure that the predetermined arithmetic function is satisfiedwithin a maximum established in accordance with rules of the auxiliaryfeature. However, according to another embodiment, the rules of theauxiliary feature do not establish such a restriction and no count ofnumber selections is recorded.

In a step 1622, it is verified whether the count of number selectionshas reached the predetermined maximum. The verification can be performedby a representative of the bingo operator or by a computer programcommunicating with the selection means. If the maximum is reached, theauxiliary feature ends in the step 1618. Otherwise, the auxiliaryfeature remains valid for the subsequent number selection performed inthe step 1604.

The systems for operating the auxiliary features and the method ofplaying the auxiliary features have been described within the context ofboth paper and electronic versions. While the paper versions provide fora static bingo card, electronic versions enable dynamic evolution of asame bingo card over the course of a game. Within the context of anelectronic version, each player can be provided with a client device,such as an electronic console, connected to a game server. Theconnection can be established over a public network such as theInternet, or a private network maintained by the bingo operator.

Referring now to FIG. 18, there is illustrated a block diagram of anelectronic system for recording and displaying a number of daubed cellsbearing a same attribute designation and for dynamically modifying thecontent of grids of play cells over the course of a game session. Thesystem is described herein below with reference to FIG. 4 and as appliedto the linked grids of play cells 402, 404, and 406.

Prior to the activation of a bingo session, the player purchases a bingoID number from the bingo operator and enters the ID number within theinterface of a client 1802. A user interface controller 1804 providesthe entered ID number to a server interface controller 1806, whichretrieves the client numbers from a bingo card numbers database 1808,and stores the retrieved client numbers within a client numbers database1814. Each client number identifies the card 400, one of the linkedgrids 402, 404, and 406, a cell within the identified one of the grids402, 404, and 406, as well as a number borne by the identified cell.Furthermore, the user interface controller 1804 retrieves the clientattribute designations from a bingo card attribute designations database1810 and stores the retrieved client attribute designations within theclient attribute designations database 1816. Each client attributeidentifies the card 400, one of the linked grids 402, 404, and 406, acell within the identified grid, as well as one of the attributedesignations 408 and 410. The user interface controller 1804 retrievesthe client numbers from the client numbers database 1814, retrieves theclient attribute designations from the client attribute designationsdatabase 1816, and displays the linked grids 402, 404, and 406 withinthe interface of the client 1802.

Once the bingo operator activates the game session, a random numbergenerator 1818 provides a random number between one and seventy-five toa number dauber 1820 and an attribute designations search engine 1822.The random number generator 1818 does not provide the same number twicewithin the course of a same session. The number dauber 1820 searchesthrough the client numbers stored within the client numbers database1814 and assigns a daub to each cell bearing the drawn number. As forthe attribute designations search engine 1822, it searches through theclient attribute designations stored within the client attributedesignations database 1816 and provides an increment signal to anattribute designations counter 1824 for each identified one of theattribute designations 408 and 410 associated to the drawn number. Theattribute designations counter 1824 holds a count of the count of daubedcells bearing the attribute designation 408 as well as a count of thosebearing the attribute designation 410. It is important to note that theincrement signal identifies the count to be incremented. The userinterface controller 1804 retrieves the daubs stored within the clientnumbers database 1814, and for each retrieved daub, displays a visualindicator within the interface of the client 1802. Furthermore, the userinterface controller 1804 retrieves the attribute designation countsfrom the attribute designation counter 1824 and, for each retrievedcount, displays a corresponding count of daubs within a correspondingone of the grids 412 and 414.

The server 1800 also comprises a random attribute designation generator1812 periodically triggered by a timer 1826 over the course of a sessionto retrieve from the bingo card numbers database 1808 grid daubpositions, and store random client attribute designations in the bingocard attribute designations database 1810 for some of those of the playcells that have yet to be daubed. The server interface controller 1806retrieves newly stored client attribute designations and stores them inthe client attribute designations database 1816. The user interfacecontroller 1804 retrieves the newly stored client attribute designationsfrom the client attribute designations database 1816 and updates thedisplay of the linked grids 402, 404, and 406 accordingly within theinterface of the client 1802. As a result, the linked grids 402, 404,and 406 dynamically evolve over the course of a session, therebypresenting players with a greater variety of content.

According to one embodiment, the random attribute designation generator1812 stores random client attribute designations in the bingo cardattribute designations database 1810 over the course of a sessionwithout any restrictions with respect to the number of client attributedesignations assigned within a grid or a series of linked grids, or thepositions of the attribute designations within a grid or a set of linkedgrids.

According to another embodiment, the random attribute designationgenerator 1812 stores random client attribute designations in the bingocard attribute designations database 1810 according to a set ofrestrictions. According to one embodiment, the restrictions limit thenumber of client attribute designations that can be assigned to a gridor a series of linked grids. According to one embodiment, therestriction limits the grid cells to which client attribute designationscan be assigned. According to one embodiment, the restrictions preventthe probability of a favourable outcome within a grid or a series oflinked grids from deviating in a substantial manner. According to oneembodiment, the restrictions ensure that all grids or series of gridsenjoy an equal probability of reaching the desired objective before thefirst number is drawn. According to one embodiment, an event over thecourse of a session such as a bonus trigger alters the restrictions ortheir applicability, thereby enabling the random number generator 1812to store client attribute designations in a manner that substantiallyincreases the probably of a favourable outcome within a grid or a seriesof linked grids.

Referring now to FIG. 19, there is illustrated a block diagram of anelectronic system for recording and providing an indication as to theprobability of a favourable outcome with respect to grids of play cells.The system is described herein below with reference to FIG. 4 and asapplied to the grids 402, 404, and 406. For the purposes of thedescription of the block diagram illustrated in FIG. 19, the grids 402,404, and 406 will be considered independent from one another.

The user interface controller 1804 of each client connected to theserver 1800, such as the client 1802, provides the grid daubs andattribute designation counts to the server interface controller 1806,which in turn stores the daubs and the ID number in a grid daubsdatabase 1900 and stores the attribute designation counts and ID numberin a designation counts database 1918, wherein each daub identifies thecard 400, a specific one of the grids 402, 404, and 406, as well as aspecific cell within the identified one of the grids 402, 404, and 406.

A progress tracker 1920 retrieves the daubs and ID numbers from thedaubs database 1900, the attribute designation counts and ID numbersfrom the attribute designation counts database 1918, the attributedesignation positions and ID numbers from the bingo card attributedesignations database 1810, as well as a current pattern from a patternsdatabase 1922, wherein the current pattern defines the objective of theauxiliary feature. For each retrieved ID number, the tracker 1920determines the corresponding probability of a favourable outcome, namelythe near win value, and provides the latter value along with thecorresponding ID number to a feature controller 1924. The aforementionedprobability is determined by comparing the progress of a card towardsthe current pattern with that of the other cards.

The feature controller 1924 retrieves a visual feature representative ofthe near win value from a features database 1926 and provides theretrieved feature to the server interface controller 1806 of theappropriate client, namely the one running the bingo card having amatching ID number. The server interface controller 1806 provides thefeature to the user interface controller 1804 in order for the interfaceof the client to be updated accordingly.

According to another embodiment, the client 1802 is a code scannermounted on a table at a specific play position. The code scanner readsID numbers of bingo cards held by a player seated at the correspondingplay position, and provides the ID number to the server 1800. Thefeature controller 1924 provides the feature signal to the scanner, inorder for the play position to be distinguished from others according tothe near win value of the card held by the player seated at the playposition.

According to one embodiment, the feature controller 1924 provides thefeature signal to a seat corresponding to the play position in order forthe seat to light up. The feature controller 1924 can also provide thefeature signal to a seat corresponding to the play position in order forthe seat to emit a distinctive sound signal. The feature controller 1924can also provide the feature to a spotlight controller in order for alamp to be directed towards the play position, and where the playposition would be distinguished by a spotlight.

According to a preferred embodiment, the feature consists in a specificcolour, and the cards found to be in near win situations are displayedin red. According to another embodiment, the feature consists in ablinking indicator displayed on cards that are found to be in a near winsituation. According to yet another embodiment, the feature consists ina scale to be displayed on the cards, wherein the scale provides anindication as to the probability of a favourable outcome. According toanother embodiment, the feature consists in an audio-visual signal.

The traditional bingo game can be perceived as a race to a predeterminedpattern, wherein each active grid competes with all other active grids.Understandably, the player that runs several grids simultaneously losesinterest in those that fall significantly behind the others.Consequently, over the course of a session, the game becomes lesschallenging as fewer grids are monitored. However, within the context ofthe game illustrated in FIG. 4, the linked grids 402, 404, and 406contribute collectively towards a desired objective, which consists inreaching a desired number of daubed cells bearing a same one of theattribute designations 408 and 410. As a result, instead of competingwith each other, the grids 402, 404, and 406 collaborate to drive a racebetween the attribute designations 408 and 410.

The grids 412 and 414 enable the player to readily compare the count ofplay cells bearing the attribute designation 408 and the count of playcells bearing the attribute designation 410, thereby bringing the racebetween the attribute designations 408 and 410 to the attention of theplayer, and simplifying the manner in which the race is monitored. Thetwo aforementioned advantages are accentuated in the embodimentillustrated in FIG. 4 as the grids 412 and 414 are each comprised of asame count of cells and disposed alongside each other.

According to one embodiment, the cells to which attribute designationsare assigned can be selected or configured to customize the manner inwhich the number of daubed cells bearing a same attribute designationprogresses towards the desired objective. For instance, in the contextof the auxiliary feature illustrated in FIG. 4, and according to oneembodiment, for every cell belonging to any one of the grids 402, 404,and 406 and to which the attribute designation 410 is assigned, there isa cell belonging to each of the two other ones of the grids 402, 404,and 406 bearing the same number and to which the attribute designations410 is assigned. However, for every cell to which the attributedesignation 408 is assigned, there is no other cell bearing the samenumber and to which the attribute designation 408 is assigned.Furthermore, the attribute designation 408 is assigned to as many cellsas the attribute designation 410 within the grids 402, 404, and 406. Asa result, the count of daubed cells bearing the attribute designation408, which represents the tortoise, is likely to progress morefrequently, but at a pace of either one cell or no cell per drawnnumber. Conversely, the count of daubed cells bearing the attributedesignation 410, which represents the hare, is likely to progress lessfrequently, but at a pace of either three cells or no cells per drawnnumber. This particular configuration replicates the progress of thehare and the tortoise described within the fable titled The Hare and theTortoise.

According to one embodiment, the grids 412 and 414 are comprised of anequal count of cells and the count of cells is adjusted in order tocustomize the probability of a favourable outcome with respect to amaximum number of drawn numbers within which the objectives are to bereached, the minimal number of drawn number before the objective can bereached, the average number of drawn numbers required before theobjective is reached, or the probability that a favourable outcome isreached within any one of the grids 412 and 414 before it is reachedwithin another one of the grids 412 and 414. According to anotherembodiment, the count of cells comprised within the grid 412 isdifferent from the count of cells comprised within the grid 414 in orderfor the aforementioned customization to be achieved.

In traditional bingo games, the player can only claim to have reached adesired objective by calling out “BINGO”, a limitation that contributesto the redundancy of the game. Furthermore, within the context of bingogames wherein several objectives are available simultaneously, asopposed to sequentially, the call-out does not identify the objectivethat has been allegedly reached.

Disclosed herein is a novel method of operating a bingo game whereindifferent call-outs are used over the course of a same session. Themethod comprises providing players with a plurality of call-outs overthe course of a bingo session, identifying a player that uses one of thecall-outs, and verifying the active bingo cards of the identified callerto determine whether an objective is reached within one of the cards ofthe caller.

According to one embodiment, the call-outs are provided at the beginningof a session and valid for the entire session. According to anotherembodiment, the call-outs are provided at the beginning of a session,each of which is valid for the entire session until it is rightfullyused by a player. In other words, when a player rightfully claims tohave reached an objective, the call-out used by the player is retiredfor the remainder of the session. However, when a player mistakenlyclaims to have reached a desired objective, the call-out used by theplayer remains valid for the remainder of the session.

According to yet another embodiment, a different call-out is assigned toeach of two objectives that are simultaneously available over the courseof a session. For instance, within the context of the embodimentillustrated in FIG. 4, players can only claim to have daubed ten cellsbearing the attribute designation 408 by calling out “TORTOISE”, and tencells bearing the attribute designation 410 by calling out “HARE”. As aresult, a call-out identifies a corresponding one of the two objectives,and players other than the caller can concentrate their verificationefforts on the identified objective as the caller walks up to theoperator to present the card.

According to yet another embodiment, participating players are dividedinto groups, each of which is assigned a different call-out, or a seriesthereof, wherein a player can only claim to have reached a desiredobjective by using the call-out assigned to the group to which theplayer belongs. For instance, players can be divided as a function oftheir gender or the position of their seat within a bingo hall.

As mentioned herein above, bingo games are typically hosted in bingohalls wherein each player purchases a bingo kit comprised of severalbingo cards, joins other players at one of several tables, and lays thepurchased cards on the table in a configuration adapted for monitoringpurposes. In other versions of bingo games, each player is provided witha client device on which purchased bingo cards are displayed. In bothcases, the surface of bingo cards, and therefore, that of bingo grids,is limited by logistical considerations such as the table surface madeavailable to players or the display surface of client devices providedthereto. Considering the aforementioned limitations, the count of cellsto be displayed within a grid, and the importance of readability withinthe context of bingo games, each number occupies most of the surface ofthe cell to which it is assigned, leaving little room for attributedesignations. However, the addition of such attribute designations isdesirable as it provides for a greater variety of bingo games.

Disclosed herein is a bingo card with a grid having twenty-five cells,twenty-four of which bear numbers, and some of which bear an attributedesignation that neither interferes with the readability of the numbersnor necessitates a substantial amount of additional surface. This isachieved by stretching the outer boundary of peripheral cells outwardlywith respect to the grid, and displaying the attribute designationwithin the stretched boundaries, wherein the peripheral cells are thoseof the cells that are located at the periphery of the grid, theattribute designation is sized for readability, the outer boundary issufficiently stretched to receive the attribute designation, and theouter boundary is not stretched beyond the needs of the attributedesignation.

According to one embodiment, the outer boundary of each peripheral cellis stretched outwardly. This embodiment is particularly advantageous forthe purposes of printing bingo cards wherein those of the peripheralcells to which the attribute designation is added vary from one card tothe next. According to another embodiment, only those of the peripheralcells that receive an attribute designation have their outer boundarystretched, thereby minimizing the surface occupied by the grid. In theparticular embodiment illustrated in FIG. 4, the addition of theattribute designations 408 and 410 is restricted to those of theperipheral cells located in the first and last column, as well as thoselocated in the last row, to avoid interference with the letters of theword “BINGO” assigned to each column. Furthermore, only those of theperipheral cells that receive an attribute designation have their outerboundary stretched, thereby minimizing the surface occupied by the grids402, 404, and 406.

1. A system for operating a bingo game played by daubing play cellsbearing selected ones of a predetermined set of symbols, the systemcomprising: a pair of linked M×N grids of the play cells, each of M andN being strictly greater than two, each one of the play cells bearingone of the set of symbols; means for randomly selecting different onesof the set of symbols; and means for displaying a predetermined patternspanning two grids, an objective of the game comprising forming thepattern using the daubed play cells belonging to any one of the pair oflinked grids, wherein the daubed play cells used in forming the patternform a different sub-pattern in each one of the pair of linked grids. 2.The system of claim 1, further comprising a third M×N grid of the playcells, each of the play cells bearing one of the set of symbols, thethird grid being linked to the pair of linked grids, wherein thedisplayed pattern spans three grids, and the game objective comprisesforming the pattern using the daubed play cells belonging to any one ofthe three linked grids.
 3. The system of claim 1, further comprising athird M×N grid of the play cells, each one of the play cells bearing oneof the symbols, the third grid being linked to the pair of linked grids,wherein the game objective comprises forming the pattern using thedaubed play cells belonging to any one of two of the three linked grids.4. The system of claim 3, wherein the three linked grids are presentedas aligned, the game objective comprises forming the pattern using thedaubed play cells belonging to any one of two contiguous ones of thethree linked grids.
 5. The system of claim 1 or 2, wherein some of theplay cells belonging to the linked grids bear an attribute designation,wherein the game objective comprises forming the pattern using thedaubed play cells belonging to any one of the linked grids and bearingthe attribute designation.
 6. The system of claim 1, 2, 3, or 5, furthercomprising a dauber for daubing each one of the play cells bearing oneof the selected symbols, and a grid of at least three tracking cells,each one of the tracking cells for receiving a daub for each one of thedaubed play cells aligned with the pattern, whereby a count of those ofthe daubed play cells belonging to one of the linked grids and alignedwith the pattern can be readily tracked to determine whether the gameobjective is met.
 7. A system for operating a bingo game played bydaubing play cells bearing selected ones of a predetermined set ofsymbols, the system comprising: a pair of linked M×N grids of the playcells, each of M and N being strictly greater than two, each one of theplay cells bearing one of the set of symbols; means for randomlyselecting different ones of the set of symbols; and means for displayinga predetermined arithmetic function to be satisfied by a first count ofeach one of the daubed play cells belonging to a first one of the pairof grids, and a second count of each one of the daubed play cellsbelonging to a second one of the pair of grids according to an objectiveof the game, wherein the arithmetic function is selected from a groupconsisting of: the first count being a product of the second count and amultiplier, the multiplier being an integer greater than one; and thefirst count being greater than the second count by a predeterminedspread, the spread being greater than zero.
 8. The system of claim 7,further comprising a third M×N grid of the play cells, each one of theplay cells bearing one of the set of symbols, the third grid beinglinked to the pair of grids, wherein the arithmetic function is to besatisfied by the first and second counts, as well as by a third count ofthose of the daubed play cells belonging to the third grid, wherein thearithmetic function is selected from a group consisting of: each one ofthe first and third counts being a product of the second count and themultiplier; and the first count being greater than the second count bythe predetermined spread, and the first count being greater than thesecond count by a second predetermined spread, the second spread beinggreater than zero.
 9. The system of claim 7, further comprising a thirdM×N grid of the play cells, each one of the play cells bearing one ofthe set of symbols, the third grid being linked to the pair of grids,wherein the arithmetic function is to be satisfied by any two of the twocounts and a third count of each one of the daubed play cells belongingto the third grid, wherein the arithmetic function is selected from agroup consisting of: one of the first, second, and third counts being aproduct of the multiplier and one of the first, second, and thirdcounts; and one of the first, second, and third counts being greaterthan one of the first, second, and third counts by the predeterminedspread.
 10. The system of claim 7, wherein some of the play cellsbelonging to the linked grids bear an attribute designation in additionto one of the set of symbols, the first count comprises a count of eachone of the daubed cells belonging to the first grid and bearing thedesignation, the second count comprises a count of each one of thedaubed cells belonging to the second grid and bearing the designation,and the arithmetic function is to be satisfied by the first and secondcounts.
 11. The system of claim 8, wherein some of the play cellsbelonging to the linked grids bear an attribute designation, the firstcount comprises a count of each one of the daubed cells belonging to thefirst grid and bearing the designation, the second count comprises acount of each one of the daubed cells belonging to the second grid andbearing the designation, the third count comprises a count of each oneof the daubed cells belonging to the third grid and bearing thedesignation, and the arithmetic function is to be satisfied by thefirst, second, and third counts.
 12. The system of claim 7, 8, 9, 10, or11, further comprising a dauber for daubing each one of the play cellsbearing one of the selected symbols, and a grid of at least threetracking cells for each corresponding one of the grids of play cells,each one of the tracking cells for receiving a daub for each one of thedaubed play cells belonging to the corresponding grid of play cells,whereby each one of the counts can be readily tracked to determinewhether the game objective is met.
 13. The system of claim 1 or 7,further comprising: a second pair of linked M×N grids of the play cells,each one of the play cells belonging to the grids of the second pairbearing one of the set of symbols; a progress tracker for identifying amost desirable one of the pairs as a function of the game objective andeach one of the daubed play cells belonging to any one of the linkedgrids, the most desirable pair being closer to the game objective; and afeature controller for identifying the most desirable pair.
 14. Thesystem of claim 13, further comprising a console for displaying thepairs, wherein the feature controller distinguishes the most desirablepair on the console.
 15. The system of claim 13, further comprising twoconsoles, each one of the consoles for displaying a different one of thepairs, wherein the feature controller identifies one of the consolesdisplaying the most desirable pair and distinguishes the identifiedconsole.
 16. The system of claim 7, wherein the arithmetic function issatisfied when the first count is a product of the second count and apredetermined multiplier, the multiplier being an integer greater thanone.
 17. The system of claim 7, wherein the arithmetic function issatisfied when the first count is greater than the second count by apredetermined spread, the spread being greater than zero.
 18. A systemfor operating a bingo game played by daubing play cells bearing selectedones of a predetermined set of numbers, the system comprising: an M×Ngrid of the play cells, each of M and N being strictly greater than two,each one of the play cells bearing one of the set of numbers; means forrandomly selecting different ones of the set of numbers; and means fordisplaying a predetermined arithmetic function to be satisfied by acount of each one of the daubed play cells belonging to the grid of playcells and a last selected one of the selected numbers borne by any oneof the play cells belonging to the grid of play cells according to anobjective of the game.
 19. The system of claim 18, further comprising asecond M×N grid of the play cells, each one of the play cells belongingto the second grid bearing one of the set of numbers, the grids of playcells being linked, wherein the arithmetic function is to be satisfiedby a count of each one of the daubed play cells belonging to any one ofthe two linked grids and a last selected one of the selected numbersborne by any one of the play cells belonging to any one of the twolinked grids.
 20. The system of claim 18, further comprising a dauberfor daubing each one of the play cells bearing one of the selectedsymbols, and a grid of at least three tracking cells, each one of thetracking cells for receiving a daub for each one of the daubed playcells, whereby a count of the daubed play cells can be readily trackedto determine whether the game objective is met.
 21. The system of claim18, wherein the arithmetic function is satisfied when the last selectednumber borne by one of the play cells belonging to the grid of playcells equals the count.
 22. A method of playing a bingo game on an M×Ngrid of play cells, each of M and N being strictly greater than two, andeach one of the play cells bearing one of a predetermined set ofsymbols, the method comprising: providing the grid of play cells;providing a grid of at least three conversion cells; randomly selectingdifferent ones of the set of symbols; play daubing those of the playcells bearing one of the selected symbols; and conversion daubing apredetermined count of different ones of the conversion cells for eachone of the daubed play cells satisfying at least one predeterminedcriterion, an objective of the game comprising daubing each one of theconversion cells.
 23. The method of claim 22, further comprisingproviding a second M×N grid of play cells, each one of the play cellsbearing one of the set of symbols, the grids of play cells being linked,wherein the play daubing comprises daubing each one of the play cellsbelonging to any one of the two grids of play cells and bearing one ofthe selected symbols, and the conversion daubing comprises daubing apredetermined count of different ones of the conversion cells for eachone of the daubed play cells satisfying the criterion and belonging toany one of the two grids of play cells.
 24. The method of claim 22 or23, further comprising assigning an attribute designation to each one ofsome of the play cells, wherein the attribute designation designateseach one of the play cells satisfying the criterion, and whereby eachone of the play cells satisfying the criterion can be readilyidentified.
 25. The method of claim 24, wherein the attributedesignation comprises a first attribute designation and a secondattribute designation, and further comprising assigning the firstattribute designation to each one of some of the play cells, andassigning a second attribute designation to each one of some of the playcells, and wherein the conversion daubing comprises daubing a firstpredetermined count of different ones of the conversion cells for eachone of the daubed play cells bearing a first one of the twodesignations, and daubing a second predetermined count of different onesof the conversion cells for each one of the daubed play cells bearing asecond one of the two designations, the first count being greater thanthe second count.
 26. The method of claim 24, further comprising:assigning a second attribute designation to each one of the play cells,the second attribute designation designating those of the cellssatisfying a second predetermined criterion; and providing a second gridof at least three conversion cells, wherein the conversion daubingcomprises daubing a first predetermined count of different ones of theconversion cells belonging to a first one of the two grids of conversioncells for each one of the daubed play cells bearing a first one of thetwo designations, and daubing a second predetermined count of differentones of the conversion cells belonging to a second one of the two gridsof conversion cells for each one of the daubed play cells bearing asecond one of the two designations.
 27. The method of claim 26, furthercomprising providing a first prize when each one of the conversion cellsof the first grid of conversion cells are daubed, and providing a secondprize when each one of the conversion cells of the second grid ofconversion cells are daubed, wherein the first prize is of greater valuethan the second prize.
 28. The method of claim 25, 26, or 27, whereinthe second designation is assigned to a greater count of the play cellsthan the first designation.
 29. The method of claim 22, 23, 24, 25, or26, further comprising providing a prize when the game objective is met.30. The method of claim 29, wherein the prize is a cash prize.
 31. Acard for playing a bingo game by daubing play cells bearing selectedones of a predetermined set of symbols, the card comprising: one M×Ngrid of the play cells, each of M and N being strictly greater than two,each one of the play cells bearing one of the set of symbols, each oneof the play cells bearing one of the selected symbols for receiving aplay daub; and one grid of at least three tracking cells, each one ofthe tracking cells for receiving a tracking daub for each one of thedaubed play cells satisfying a predetermined criterion, the trackingdaubs indicating a count of those of the daubed play cells satisfyingthe criterion, an objective of the game comprising daubing each one ofthe tracking cells.
 32. The card of claim 31, further comprising asecond M×N grid of the play cells, each one of the play cells of thesecond grid of play cells bearing one of the set of symbols, each one ofthe play cells of the second grid of play cells bearing a selected oneof the set of symbols for receiving a daub, the two grids of play cellsbeing linked, wherein each one of the tracking cells is for receiving adaub for each one of the daubed play cells belonging to any one of thetwo linked grids and satisfying the criterion.
 33. The card of claim 31or 32, wherein an attribute designation is assigned to at least some ofthose of the play cells satisfying the criterion, and whereby at leastsome of those of the play cells satisfying the criterion can be readilyidentified.
 34. The card of claim 33, further comprising a second gridof at least three tracking cells, wherein a second attribute designationis assigned to at least some of the play cells satisfying the criterion,each one of the tracking cells of a first one of the two grids oftracking cells is for receiving a daub for each of the daubed play cellsbearing a first of the two designations, and each one of the trackingcells of a second one of the two grids of tracking cells is forreceiving a daub for each of the daubed play cells bearing a second ofthe two designations.
 35. The card of claim 34, wherein the second ofthe two designations is assigned to a greater count of the play cellsthan the first of the two designations.
 36. The card of claim 33,wherein at least one of peripheral ones of the play cells has a mainsurface for displaying one of the set of symbols, and a protuberancesurface extending outwardly for displaying the attribute designation,whereby readability of the symbols is not hindered by the display of theattribute designation.
 37. A system for operating a bingo game played bydaubing play cells bearing selected ones of a predetermined set ofsymbols, the system comprising: a console for electronically displayinga grid of M×N of the play cells, each of M and N being strictly greaterthan two, each one of the play cells bearing one of the set of symbols;a symbol selector for periodically and randomly selecting a differentone of the set of symbols; a dauber for daubing each one of the playcells bearing one of the selected symbols; and a random attributegenerator for modifying the displayed grid by randomly assigning anattribute designation to at least one of the play cells, the attributedesignation designating each one of the play cells having specialattributes in meeting an objective of the game.
 38. The system of claim37, wherein the attribute generator randomly assigns the attributedesignation to a predetermined count of the play cells.
 39. The systemof claim 37, wherein the attribute generator randomly assigns theattribute designation to a random count of the play cells.
 40. Thesystem of claim 37, wherein the attribute generator assigns thedesignation to an increasing count of the play cells.
 41. The system ofclaim 37, wherein the attributor generator identifies each one of theplay cells that are yet to be daubed and assigns the attributedesignation to at least one of the identified play cells.
 42. The systemof claim 37, 38, 39, 40, or 41, further comprising a timer fortriggering the attribute generator according to a predeterminedschedule.
 43. The system of claim 37, 38, 39, 40, or 41, furthercomprising a timer for triggering the attribute generator periodically.44. A system for operating a bingo game played by daubing play cellsbearing selected ones of a predetermined set of symbols, the systemcomprising: two different grids of M×N of the play cells, each of M andN being strictly greater than two, each one of the play cells bearingone of the set of symbols; a symbol selector for periodically andrandomly selecting a different one of the set of symbols; a dauber fordaubing each one of the play cells bearing one of the selected symbols;a progress tracker for identifying a most desirable one of the two gridsas a function of the daubed cells and an objective of the game, the moredesirable grid being closer to a game objective; and a featurecontroller for identifying the most desirable grid.
 45. The system ofclaim 44, further comprising a first console for displaying the grids,wherein the feature controller distinguishes the most desirable grid onthe console.
 46. The system of claim 44, further comprising twoconsoles, each one of the consoles for displaying a different one of thegrids, wherein the feature controller identifies one of the consolesdisplaying the most desirable grid and distinguishes the identifiedconsole.
 47. The system of claim 44 or 46, wherein the most desirablegrid is identified by a sound signal.
 48. The system of claim 44,further comprising: two bingo cards, each one of the bingo cardsdisplaying a different one of the grids and having a differentvalidation code; and two code scanners mountable on a table at differentones of two play positions, each one of the scanners for reading thevalidation code of a different one of the two bingo cards and forproviding the read validation code to the feature controller, whereinthe feature controller identifies one of the play positionscorresponding to the most desirable grid and distinguishes theidentified play position.
 49. The system of claim 1, 7, 18, 37, or 44,further comprising a payout controller for providing a prize when thegame objective is met.
 50. The system of claim 49, wherein the prize isa cash prize.
 51. The system of claim 1, 7, 18, 37, or 44, furthercomprising a dauber for daubing those of the play cells bearing one ofthe selected symbols, whereby those of the play cells belonging to anyone of the linked grids and bearing one of the selected symbols can bereadily tracked to determine whether the game objective is met.
 52. Thesystem of claim 1, 7, 18, 37, or 44, wherein the means for selectingcomprises a blower.
 53. The system of claim 1, 7, 37, or 44, wherein thesymbols are numbers.
 54. A system for operating an auxiliary feature ofa bingo game, the bingo game played by daubing play cells bearingselected ones of a predetermined set of symbols, the system comprising:a pair of linked M×N grids of the play cells, each of M and N beingstrictly greater than two, each one of the play cells bearing one of theset of symbols; and means for displaying a predetermined patternspanning two grids, wherein an incentive prize is awarded upon formingthe pattern using the daubed play cells belonging to any one of the pairof linked grids.
 55. The system of claim 54, further comprising a thirdM×N grid of the play cells, each of the play cells bearing one of theset of symbols, the third grid being linked to the pair of linked grids,wherein the displayed pattern spans three grids, and the incentive prizeis awarded upon forming the pattern using the daubed play cellsbelonging to any one of the three linked grids.
 56. The system of claim54, further comprising a third M×N grid of the play cells, each one ofthe play cells bearing one of the symbols, the third grid being linkedto the pair of linked grids, wherein the incentive prize is awarded uponforming the pattern using the daubed play cells belonging to any one oftwo of the three linked grids.
 57. The system of claim 56, wherein thethree linked grids are presented as aligned, and the incentive prize isawarded upon forming the pattern using the daubed play cells belongingto any one of two contiguous ones of the three linked grids.
 58. Thesystem of claim 54 or 55, wherein some of the play cells belonging tothe linked grids bear an attribute designation, wherein the incentiveprize is awarded upon forming the pattern using the daubed play cellsbelonging to any one of the linked grids and bearing the attributedesignation.
 59. The system of claim 54, 55, 56, or 57, furthercomprising a dauber for daubing each one of the play cells bearing oneof the selected symbols, and a grid of at least three tracking cells,each one of the tracking cells for receiving a daub for each one of thedaubed play cells aligned with the pattern, whereby a count of those ofthe daubed play cells belonging to one of the linked grids and alignedwith the pattern can be readily tracked to determine whether theincentive prize is earned.
 60. A system for operating an auxiliaryfeature of a bingo game played by daubing play cells bearing selectedones of a predetermined set of symbols, the system comprising: a pair oflinked M×N grids of the play cells, each of M and N being strictlygreater than two, each one of the play cells bearing one of the set ofsymbols; and means for displaying a predetermined arithmetic function tobe satisfied by a first count of each one of the daubed play cellsbelonging to a first one of the pair of grids, and a second count ofeach one of the daubed play cells belonging to a second one of the pairof grids, wherein an incentive prize is awarded upon satisfaction of thearithmetic function.
 61. The system of claim 60, further comprising athird M×N grid of the play cells, each one of the play cells bearing oneof the set symbols, the third grid being linked to the pair of grids,wherein the arithmetic function is to be satisfied by the first andsecond counts, as well as by a third count of each one of the daubedplay cells belonging to the third grid.
 62. The system of claim 60,further comprising a third M×N grid of the play cells, each one of theplay cells bearing one of the set symbols, the third grid being linkedto the pair of grids, wherein the arithmetic function is to be satisfiedby any two of the two counts and a third count of each one of the daubedplay cells belonging to the third grid.
 63. The system of claim 60,wherein some of the play cells belonging to the linked grids bear anattribute designation in addition to one of the symbols, the first countcomprises a count of those of the daubed cells belonging to the firstgrid and bearing the designation, the second count comprises a count ofthose of the daubed cells belonging to the second grid and bearing thedesignation, and the arithmetic function is to be satisfied by the firstand second counts.
 64. The system of claim 62, wherein some of the playcells belonging to the linked grids bear an attribute designation, thefirst count comprises a count of each one of the daubed cells belongingto the first grid and bearing the designation, the second countcomprises a count of each one of the daubed cells belonging to thesecond grid and bearing the designation, the third count comprises acount of each one of the daubed cells belonging to the third grid andbearing the designation, and the arithmetic function is to be satisfiedby the first, second, and third counts.
 65. The system of claim 60, 61,62, 63, or 64, further comprising a dauber for daubing each one of theplay cells bearing one of the selected symbols, and a grid of at leastthree tracking cells for each corresponding one of the grids of playcells, each one of the tracking cells for receiving a daub for each oneof the daubed play cells belonging to the corresponding grid of playcells, whereby each one of the counts can be readily tracked todetermine whether the game objective is met.
 66. The system of claim 54or 60, further comprising: a second pair of linked M×N grids of the playcells, each one of the play cells belonging to the grids of the secondpair bearing one of the set of symbols; a progress tracker foridentifying a most desirable one of the pairs as a function of the gameobjective and each one of the daubed play cells belonging to any one ofthe linked grids, the most desirable pair being closer to satisfactionof the arithmetic function; and a feature controller for identifying themost desirable pair.
 67. The system of claim 66, further comprising aconsole for displaying the pairs, wherein the feature controllerdistinguishes the most desirable pair on the console.
 68. The system ofclaim 66, further comprising two consoles, each one of the consoles fordisplaying a different one of the pairs, wherein the feature controlleridentifies one of the consoles displaying the most desirable pair anddistinguishes the identified console.
 69. The system of claim 60,wherein the arithmetic function is satisfied when the first count is amultiple of the second count.
 70. The system of claim 60, wherein thearithmetic function is satisfied when the first count is greater thanthe second count by a predetermined spread.
 71. A system for operatingan auxiliary feature of a bingo game played by daubing play cellsbearing selected ones of a predetermined set of numbers, the systemcomprising: an M×N grid of the play cells, each of M and N beingstrictly greater than two, each one of the play cells bearing one of theset of numbers; and means for displaying a predetermined arithmeticfunction to be satisfied by a count of each one of the daubed play cellsbelonging to the grid of play cells and a last selected one of theselected numbers borne by any one of the play cells belonging to thegrid of play cells, wherein an incentive prize is awarded uponsatisfaction of the arithmetic function.
 72. The system of claim 71,further comprising a second M×N grid of the play cells, each one of theplay cells belonging to the second grid bearing one of the set ofnumbers, the grids of play cells being linked, wherein the arithmeticfunction is to be satisfied by a count of each one of the daubed playcells belonging to any one of the two linked grids and a last selectedone of the selected numbers borne by any one of the play cells belongingto any one of the two linked grids.
 73. The system of claim 71, furthercomprising a dauber for daubing each one of the play cells bearing oneof the selected symbols, and a grid of at least three tracking cells,each one of the tracking cells for receiving a daub for each one of thedaubed play cells, whereby a count of the daubed play cells can bereadily tracked to determine whether the incentive prize is earned. 74.The system of claim 71, wherein the arithmetic function is satisfiedwhen the last selected number borne by one of the play cells belongingto the grid of play cells equals the count.
 75. A method of playing abingo game having an auxiliary feature on an M×N grid of play cells,each one of M and N being strictly greater than two, and each one of theplay cells bearing one of a predetermined set of numbers, the bingo gameplayed by play daubing each one of the play cells bearing a selected oneof the set of numbers, the method comprising: providing a grid of atleast three conversion cells; and conversion daubing a predeterminedcount of different ones of the conversion cells for each one of thedaubed play cells satisfying at least one predetermined criterion,wherein an incentive prize is awarded when each one of the conversioncells is daubed.
 76. The method of claim 75, further comprisingproviding a second M×N grid of play cells, each one of the play cellsbearing one of the set of symbols, the grids of play cells being linked,wherein the play daubing comprises daubing those of the play cellsbelonging to any one of the two grids of play cells and bearing one ofthe selected symbols, and the conversion daubing comprises daubing apredetermined count of different ones of the conversion cells for eachone of the daubed play cells satisfying the criterion and belonging toany one of the two grids of play cells.
 77. The method of claim 75 or76, further comprising assigning an attribute designation to each one ofsome of the play cells, wherein the attribute designation designateseach one of the play cells satisfying the criterion, and whereby eachone of the play cells satisfying the criterion can be readilyidentified.
 78. The method of claim 77, wherein the attributedesignation comprises a first attribute designation and a secondattribute designation, and further comprising assigning the firstattribute designation to each one of some of the play cells, andassigning a second attribute designation to each one of some of the playcells, and wherein the conversion daubing comprises daubing a firstpredetermined count of different ones of the conversion cells for eachone of the daubed play cells bearing a first one of the twodesignations, and daubing a second predetermined count of different onesof the conversion cells for each one of the daubed play cells bearing asecond one of the two designations, the first count being greater thanthe second count.
 79. The method of claim 77, further comprising:assigning a second attribute designation to each one of the play cells,the second attribute designation designating those of the cellssatisfying a second predetermined criterion; and providing a second gridof at least three conversion cells, wherein the conversion daubingcomprises daubing a first predetermined count of different ones of theconversion cells belonging to a first one of the two grids of conversioncells for each one of the daubed play cells bearing a first one of thetwo designations, and daubing a second predetermined count of differentones of the conversion cells belonging to a second one of the two gridsof conversion cells for each one of the daubed play cells bearing asecond one of the two designations.
 80. The method of claim 79, whereinthe incentive prize comprises a first incentive prize awarded when eachone of the conversion cells of the first grid of conversion cells aredaubed, and a second incentive prize awarded when each one of theconversion cells of the second grid of conversion cells are daubed,wherein the first prize is of greater value than the second prize. 81.The method of claim 78, 79, or 80, wherein the second designation isassigned to a greater count of the play cells than the firstdesignation.
 82. The method of claim 75, 76, 77, 78, or 79, furthercomprising providing a prize when the game objective is met.
 83. Themethod of claim 82, wherein the incentive prize is a cash prize.
 84. Asystem for operating a bingo game having an auxiliary feature, the bingogame played by daubing play cells bearing selected ones of apredetermined set of symbols, the system comprising: a console forelectronically displaying a grid of M×N of the play cells, each of M andN being strictly greater than two, each one of the play cells bearingone of the set of symbols; and a random attribute generator formodifying the displayed grid by randomly assigning an attributedesignation to at least one of the play cells, the attribute designationdesignating each one of the play cells satisfying a predeterminedcriterion, wherein an incentive prize is awarded when a predeterminedcount of the daubed play cells satisfy the criterion.
 85. The system ofclaim 84, wherein the attribute generator randomly assigns the attributedesignation to a predetermined count of the play cells.
 86. The systemof claim 84, wherein the attribute generator randomly assigns theattribute designation to a random count of the play cells.
 87. Thesystem of claim 84, wherein the attribute generator assigns thedesignation to an increasing count of the play cells.
 88. The system ofclaim 84, wherein the attributor generator identifies each one of theplay cells that are yet to be daubed and assigns the attributedesignation to at least one of the identified play cells.
 89. The systemof claim 84, 85, 86, 87, or 88, further comprising a timer fortriggering the attribute generator according to a predeterminedschedule.
 90. The system of claim 84, 85, 86, 87, or 88, furthercomprising a timer for triggering the attribute generator periodically.91. The system of claim 54, 60, 71, 75, or 84, wherein the incentiveprize is a cash prize.
 92. The system of claim 54, 60, 71, 75, or 84,further comprising a dauber for daubing those of the play cells bearingone of the selected symbols, whereby those of the play cells belongingto any one of the linked grids and bearing one of the selected symbolscan be readily tracked to determine whether the incentive prize isearned.
 93. The system of claim 54, 60, 75, or 84, wherein the symbolsare numbers.
 94. The system of claim 4 or 57, further comprising aconsole for displaying the aligned grids.
 95. The system of claim 1, 7,18, 54, 60, or 71, wherein the means for displaying is an electronicscreen.